Table of Contents

• Counting and Enumerating Crossing-free Geometric GraphsManuel Wettstein. 1 [doi]
• A Framework for Computing the Greedy SpannerQuirijn W. Bouts, Alex P. ten Brink, Kevin Buchin. 11 [doi]
• There are Plane Spanners of Maximum Degree 4Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia. 20 [doi]
• New and Improved Spanning Ratios for Yao GraphsLuis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia. 30 [doi]
• On Constant Factors in Comparison-Based Geometric Algorithms and Data StructuresTimothy M. Chan, Patrick Lee. 40 [doi]
• Progressive Geometric AlgorithmsSander P. A. Alewijnse, T. M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg. 50 [doi]
• On the Impossibility of Dimension Reduction for Doubling Subsets of ℓpYair Bartal, Lee-Ad Gottlieb, Ofer Neiman. 60 [doi]
• The limited blessing of low dimensionality: when 1-1/d is the best possible exponent for d-dimensional geometric problemsDániel Marx, Anastasios Sidiropoulos. 67 [doi]
• Design of 3D printed mathematical artHenry Segerman. 77 [doi]
• Embeddability in the 3-sphere is decidableJirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner. 78 [doi]
• The Connect-The-Dots Family of Puzzles: The VideoMira Kaiser, Tim van Kapel, Gerwin Klappe, Marc J. van Kreveld, Maarten Löffler, Frank Staals. 85 [doi]
• LiveCG: an Interactive Visualization Environment for Computational GeometrySebastian Kürten, Wolfgang Mulzer. 86 [doi]
• Trajectory Grouping Structure: the VideoKevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals. 88 [doi]
• Visualizing hyperbolic Voronoi diagramsFrank Nielsen, Richard Nock. 90 [doi]
• Animation of an Algorithm for Drawing Graphs in 3DLezar DeGuzman, Stephen K. Wismath. 92 [doi]
• Visualization of Floater and Gotsman's Morphing AlgorithmIvaylo Ilinkin. 94 [doi]
• Geometric kth Shortest Paths: the AppletJohn Hershberger, Valentin Polishchuk, Bettina Speckmann, Topi Talvitie. 96 [doi]
• Polytope Offsets and Straight Skeletons in 3DFranz Aurenhammer, Gernot Walzl. 98 [doi]
• Optimal Geometric Flows via Dual ProgramsSylvester David Eriksson-Bique, Valentin Polishchuk, Mikko Sysikaski. 100 [doi]
• Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related ProblemsHu Ding, Jinhui Xu. 110 [doi]
• Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of PolygonsSariel Har-Peled. 120 [doi]
• A near-optimal approximation algorithm for Asymmetric TSP on embedded graphsJeff Erickson, Anastasios Sidiropoulos. 130 [doi]
• Outerstring graphs are χ-boundedAlexandre Rok, Bartosz Walczak. 136 [doi]
• Improved bounds for the conflict-free chromatic art gallery problemAndreas Bärtschi, Subir Kumar Ghosh, Matús Mihalák, Thomas Tschager, Peter Widmayer. 144 [doi]
• Linear transformation distance for bichromatic matchingsOswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber. 154 [doi]
• Delaunay triangulations with disconnected realization spacesArnau Padrol, Louis Theran. 163 [doi]
• Eliminating Tverberg Points, I. An Analogue of the Whitney TrickIsaac Mabillard, Uli Wagner. 171 [doi]
• Higher Dimensional Cheeger InequalitiesAnna Gundert, May Szedlák. 181 [doi]
• Incidences between points and lines in R4: Extended AbstractMicha Sharir, Noam Solomon. 189 [doi]
• On triple intersections of three families of unit circlesOrit E. Raz, Micha Sharir, József Solymosi. 198 [doi]
• Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear StorageTal Kaminker, Micha Sharir. 206 [doi]
• Smallest enclosing ball for probabilistic dataAlexander Munteanu, Christian Sohler, Dan Feldman. 214 [doi]
• Peeling Potatoes Near-Optimally in Near-Linear TimeSergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr. 224 [doi]
• On the Complexity of Randomly Weighted Voronoi DiagramsSariel Har-Peled, Benjamin Raichel. 232 [doi]
• A Census of Plane Graphs with Polyline EdgesAndrea Francke, Csaba D. Tóth. 242 [doi]
• Polynomials vanishing on grids: The Elekes-Rónyai problem revisitedOrit E. Raz, Micha Sharir, József Solymosi. 251 [doi]
• Using Convex Relaxations for Efficiently and Privately Releasing MarginalsCynthia Dwork, Aleksandar Nikolov, Kunal Talwar. 261 [doi]
• Near-Linear Algorithms for Geometric Hitting Sets and Set CoversPankaj K. Agarwal, Jiangwei Pan. 271 [doi]
• Better embeddings for planar Earth-Mover Distance over sparse setsArturs Backurs, Piotr Indyk. 280 [doi]
• Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay RefinementJonathan Richard Shewchuk, Hang Si. 290 [doi]
• On the reconstruction of convex sets from random normal measurementsHiba Abdallah, Quentin Mérigot. 300 [doi]
• Intersection of paraboloids and application to Minkowski-type problemsPedro Machado Manhães de Castro, Quentin Mérigot, Boris Thibert. 308 [doi]
• Efficient Random-Walk Methods for Approximating Polytope VolumeIoannis Z. Emiris, Vissarion Fisikopoulos. 318 [doi]
• The Persistent Homology of Distance Functions under Random ProjectionDonald Sheehy. 328 [doi]
• Discrete Systolic Inequalities and Decompositions of Triangulated SurfacesÉric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay. 335 [doi]
• Computing Topological Persistence for Simplicial MapsTamal K. Dey, Fengtao Fan, Yusu Wang. 345 [doi]
• Induced Matchings of Barcodes and the Algebraic Stability of PersistenceUlrich Bauer, Michael Lesnick. 355 [doi]
• Towards Expressive 3D Modeling: new challenges for geometric computingMarie-Paule Cani. 365 [doi]
• Computing the Fréchet distance with shortcuts is NP-hardMaike Buchin, Anne Driemel, Bettina Speckmann. 367 [doi]
• The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and SelectionRinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir. 377 [doi]
• Light spanners for Snowflake MetricsLee-Ad Gottlieb, Shay Solomon. 387 [doi]
• Continuously Flattening Polyhedra Using Straight SkeletonsZachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke. 396 [doi]
• Two-Point L1 Shortest Path Queries in the PlaneDanny Z. Chen, Rajasekhar Inkulu, Haitao Wang. 406 [doi]
• Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-KernelsSunil Arya, Timothy M. Chan. 416 [doi]
• Free Edge Lengths in Plane GraphsZachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Moric, Yoshio Okamoto, Tibor Szabó, Csaba D. Tóth. 426 [doi]
• Weight Balancing on Boundaries and SkeletonsLuis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang. 436 [doi]
• Separation by Convex Pseudo-CirclesNicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner. 444 [doi]
• Euclidean Steiner Shallow-Light TreesShay Solomon. 454 [doi]
• Measuring Distance between Reeb GraphsUlrich Bauer, Xiaoyin Ge, Yusu Wang. 464 [doi]
• Stochastic Convergence of Persistence Landscapes and SilhouettesFrédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Larry A. Wasserman. 474 [doi]
• The Morse Theory of Čech and Delaunay FiltrationsUlrich Bauer, Herbert Edelsbrunner. 484 [doi]
• Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type GraphFrédéric Chazal, Jian Sun. 491 [doi]
• Metric Embedding, Hyperbolic Space, and Social NetworksKevin Verbeek, Subhash Suri. 501 [doi]
• Sampling with Removal in LP-type ProblemsBernd Gärtner. 511 [doi]
• Liftings and stresses for planar periodic frameworksCiprian Borcea, Ileana Streinu. 519 [doi]
• The Opaque SquareAdrian Dumitrescu, Minghui Jiang. 529 [doi]
• The JS-graphs of Join and Split TreesSuyi Wang, Yusu Wang, Rephael Wenger. 539 [doi]
• Distinct distances on algebraic curves in the planeJános Pach, Frank de Zeeuw. 549 [doi]
• Lower bounds on geometric Ramsey functionsMarek Elias, Jirí Matousek, Edgardo Roldán-Pensado, Zuzana Safernová. 558 [doi]
• Curves in Rd intersecting every hyperplane at most d + 1 timesImre Bárány, Jirí Matousek, Attila Pór. 565 [doi]