Vol. 16 No. 1 (2025)

Articles

• On Steiner Trees of the regular simplex

  Henry Fleischmann, Guillermo Gamboa Quintero, Karthik C. S., Josef Matějka, Jakub Petr

  1–34

  • PDF

• The perimeter and volume of a Reuleaux polyhedron

  Ryan Hynd

  35–64

  • PDF

• Chromatic k-nearest neighbor queries

  Thijs van der Horst, Maarten Löffler, Frank Staals

  65–107

  • PDF

• Geometric hitting set for line-constrained disks and related problems

  Gang Liu, Haitao Wang

  108–140

  • PDF

• Density approximation for moving groups

  Max van Mulken, Bettina Speckmann, Kevin Verbeek

  141–166

  • PDF

• Computing smallest convex intersecting polygons

  Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos

  167–202

  • PDF

• Simplification of polyline bundles of graphs and trees

  Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink

  203–252

  • PDF

• Reconfiguration of colorings in triangulations of the sphere

  Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

  253–294

  • PDF

• Flips in colorful triangulations

  Rohan Acharya, Torsten Mütze, Francesco Verciani

  295–332

  • PDF

• Planarizing graphs and their drawings by vertex splitting

  Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms

  333–372

  • PDF

• Art galleries and mobile guards: revisiting O'Rourke's proof

  Ahmad Biniaz

  373–377

  • PDF

• 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. Schardl

  378–452

  • PDF

• Approximating the smallest $k$-enclosing geodesic disc in a simple polygon

  Prosenjit Bose, Anthony D'Angelo, Stephane Durocher

  453–487

  • PDF

• Polygon-universal graphs

  Tim Ophelders, Ignaz Rutter, Bettina Speckmann, Kevin Verbeek

  488–516

  • PDF

• An interlaced algorithm for transforming plane triangulations using simultaneous flips

  Tanvir Kaykobad

  517–550

  • PDF

• Dynamic unit-disk range reporting

  Haitao Wang, Yiming Zhao

  551–600

  • PDF

• Folding polyominoes into cubes

  Oswin Aichholzer, Florian Lehner, Christian Lindorfer

  601–634

  • PDF

• An algorithm to construct one-vertex triangulations of Heegaard splittings

  Alexander He, James Morgan, Em K. Thompson

  635–693

  • PDF

• Excluding cosmetic surgeries on hyperbolic 3-manifolds

  David Futer, Jessica S. Purcell, Saul Schleimer

  694–736

  • PDF

• Metric and geometric spanners that are resilient to degree-bounded edge faults

  Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid

  737–764

  • PDF

• Computing continuous dynamic time warping of time series in polynomial time

  Kevin Buchin, André Nusser, Sampson Wong

  765–799

  • PDF

• Optimal in-place compaction of sliding cubes

  Tom Peters, Irina Kostitsyna, Tim Ophelders, Irene Parada, Willem Sonke, Bettina Speckmann

  800–820

  • PDF