About the Journal
The Journal of Computational Geometry (JoCG) is an international open access journal devoted to publishing original research of the highest quality in all aspects of computational geometry. JoCG uses a single-blind peer review process.
JoCG publishes in the diamond open access model: JoCG articles and supplementary data are freely available for download, and JoCG charges no publishing fees of any kind.
All JoCG issues and articles are assigned a DOI. JoCG's data and content are safeguarded through several backup mechanisms.
JoCG is a member of the Free Journal Network; see the entry about JoCG in the Directory of Open Access Journals.
Current Issue
Vol. 16 No. 1 (2025)
Published:
2025年02月19日
Articles
-
On Steiner Trees of the regular simplex
Henry Fleischmann, Guillermo Gamboa Quintero, Karthik C. S., Josef Matějka, Jakub Petr1–34 -
Geometric hitting set for line-constrained disks and related problems
Gang Liu, Haitao Wang108–140 -
Density approximation for moving groups
Max van Mulken, Bettina Speckmann, Kevin Verbeek141–166 -
Computing smallest convex intersecting polygons
Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos167–202 -
Simplification of polyline bundles of graphs and trees
Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink203–252 -
Reconfiguration of colorings in triangulations of the sphere
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki253–294 -
Planarizing graphs and their drawings by vertex splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms333–372 -
Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl378–452 -
Approximating the smallest $k$-enclosing geodesic disc in a simple polygon
Prosenjit Bose, Anthony D'Angelo, Stephane Durocher453–487 -
An interlaced algorithm for transforming plane triangulations using simultaneous flips
Tanvir Kaykobad517–550