Table of Contents

• Turning Orthogonally Convex Polyhedra into OrthoballsFidel Barrera-Cruz, Therese C. Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamide Vosoughpour. [doi]
• Pursuit and Evasion with Uncertain Bearing MeasurementsJoshua Vander Hook, Volkan Isler. [doi]
• Forest-Like Abstract Voronoi Diagrams in Linear TimeCecilia Bohler, Rolf Klein, Chih-Hung Liu. [doi]
• Approximate Matching of Curves to Point SetsPaul Accisano, Alper Üngör. [doi]
• The τ-Skyline for Uncertain DataHaitao Wang, Wuzhou Zhang. [doi]
• Quickly Placing a Point to Maximize AnglesBoris Aronov, Mark V. Yagnatinsky. [doi]
• Quality Ratios of Measures for Graph Drawing StylesMichael Hoffmann, Marc van Kreveld, Vincent Kusters, Günter Rote. [doi]
• Visibility Graphs, Dismantlability, and the Cops and Robbers GameAnna Lubiw, Jack Snoeyink, Hamide Vosoughpour. [doi]
• All Approximating Segments for a Sequence of PointsGhobad Emadi, Alireza Zarei. [doi]
• Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance FunctionsStefan Huber, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber. [doi]
• Time, Space, and Precision: Revisiting Classic Problems in Computational Geometry with Degree-Driven Analysis, pp. 280Jack Snoeyink. [doi]
• Window Queries On Planar Subdivisions Arising From Overlapping PolygonsStuart A. Macgillivray, Bradford G. Nickerson. [doi]
• Computing the Geodesic Centers of a Polygonal DomainSang Won Bae, Matias Korman, Yoshio Okamoto. [doi]
• Representing a Planar Straight-Line Graph Using Few ObstaclesMatthew P. Johnson, Deniz Sariöz. [doi]
• Packing Plane Spanning Trees and Paths in Complete Geometric GraphsOswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl. [doi]
• Covering Orthogonal Polygons with Sliding k-TransmittersSalma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi. [doi]
• On Combinatorial Depth MeasuresStephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, Matthew Skala. [doi]
• The Maximum Disjoint Set of Boundary RectanglesAmirMahdi Ahmadinejad, Hamid Zarrabi-Zadeh. [doi]
• Bumpy Pyramid FoldingZachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, Ryuhei Uehara. [doi]
• Graph Drawings with Relative Edge Length SpecificationsOswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote. [doi]
• Decontaminating Planar Regions by Sweeping with Barrier CurvesBorislav Karaivanov, Minko Markov, Jack Snoeyink, Tzvetalin S. Vassilev. [doi]
• The Convex Hull of Points on a Sphere is a SpannerProsenjit Bose, Simon Pratt, Michiel H. M. Smid. [doi]
• Dimension Detection with Local HomologyTamal K. Dey, Fengtao Fan, Yusu Wang. [doi]
• Approximating Full Steiner Tree in a Unit Disk GraphAhmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. [doi]
• Cuttings in 2D RevisitedTimothy M. Chan. [doi]
• Drawing the Horton Set in an Integer Grid of Minimun SizeLuis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano. [doi]
• n with Few CrossingsBernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos 0001, Birgit Vogtenhuber. [doi]
• On the Spanning Ratio of Constrained Yao-GraphsAndré van Renssen. [doi]
• A Linear Time Euclidean Spanner on Imprecise PointsJiemin Zeng, Jie Gao. [doi]
• Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^dZahed Rahmati, Mohammad Ali Abam, Valerie King, Sue Whitesides. [doi]
• A Note on Online Steiner Tree ProblemsGokarna Sharma, Costas Busch. [doi]
• Order types and cross-sections of line arrangements in R^3Oswin Aichholzer, Ruy Fabila Monroy, Ferran Hurtado, Pablo Pérez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, Birgit Vogtenhuber. [doi]
• Almost Online Square PackingShahin Kamali, Alejandro López-Ortiz. [doi]
• An Improved Method for Generating Triangle-Mesh Models of ImagesXiao (Brian) Ma, Michael D. Adams. [doi]
• An Incidence Geometry Approach to Dictionary LearningMeera Sitharam, Mohamad Tarifi, Menghan Wang. [doi]
• Improved Bounds for Smallest Enclosing Disk Range QueriesSankalp Khare, Jatin Agarwal, Nadeem Moidu, Kannan Srinathan. [doi]
• On the Computational Complexity of Partitioning Weighted Points into a Grid of QuadrilateralsAlexander Idelberger, Maciej Liskiewicz. [doi]
• A Separator Theorem for Intersecting Objects in the PlaneNabil H. Mustafa, Rajiv Raman. [doi]
• Low Space Data Structures for Geometric Range Mode QueryStephane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan. [doi]
• Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point SetsMichael J. Bannister, William E. Devanny, Michael T. Goodrich, Joseph A. Simons, Lowell Trott. [doi]
• Colored Ray ConfigurationsRuy Fabila Monroy, Alfredo García Olaverri, Ferran Hurtado, Rafel Jaume, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Jorge Urrutia. [doi]
• A PTAS for the Continuous 1.5D Terrain Guarding ProblemStephan Friedrichs, Michael Hemmer, Christiane Schmidt 0001. [doi]
• Computational Topology in Reconstruction, Mesh Generation, and Data AnalysisTamal K. Dey. [doi]
• On the Use of Adaptive, Exact Decisions Number Types Based on Expression-Dags in Geometric ComputingStefan Schirra. [doi]
• Bottleneck Bichromatic Plane Matching of PointsAhmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. [doi]
• On the Chromatic Art Gallery ProblemSándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph B. M. Mitchell, Christiane Schmidt 0001. [doi]
• Drawing Plane Triangulations with Few Segments, pp. 40-45Stephane Durocher, Debajyoti Mondal. [doi]
• Covering Grids by TreesAdrian Dumitrescu, Csaba D. Tóth. [doi]
• The Duality of Geodesic Voronoi/Delaunay Diagrams For An Intrinsic Discrete Laplace-Beltrami Operator on Simplicial SurfacesYong-Jin Liu, Chunxu Xu, Ying He 0001, Deok-Soo Kim. [doi]
• Routing in a Polygonal Terrain with the Shortest Beacon WatchtowerBahram Kouhestani, David Rappaport, Kai Salomma. [doi]
• The Mutual Visibility Problem for Oblivious RobotsGiuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta. [doi]
• Voronoi Games and Epsilon NetsAritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid. [doi]
• Continuous Yao GraphsLuis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot. [doi]
• On the d-Runaway Rectangle Escape ProblemAniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty. [doi]
• A Succinct, Dynamic Data Structure for Proximity Queries on Point SetsPrayaag Venkat, David M. Mount. [doi]
• Geometric Hitting Set and Set Cover Problem with Half-StripsApurva Mudgal, Supantha Pandit. [doi]
• Minimum Dilation Triangulation: Reaching Optimality EfficientlyAléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende. [doi]
• Uniqueness of Optimal Cube WrappingQinxuan Pan. [doi]
• Minimum Convex Container of Two Convex Polytopes under TranslationsHee-Kap Ahn, Sang Won Bae, Otfried Cheong, Dongwoo Park, Chan-Su Shin. [doi]
• Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy. [doi]
• Sphere Packing with Limited OverlapMabel Iglesias Ham, Michael Kerber, Caroline Uhler. [doi]
• On the VC-Dimension of Visibility in Monotone PolygonsMatt Gibson, Erik Krohn, Qing Wang. [doi]
• The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection PuzzlesEli Fox-Epstein, Ryuhei Uehara. [doi]
• Planar Graphs with Many Perfect Matchings and ForestsMichael Biro. [doi]
• Maximum Independent Set for Interval Graphs and Trees in Space Efficient ModelsBinay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy. [doi]
• Searching by Panning and ZoomingProsenjit Bose, John Howat, Pat Morin. [doi]