Table of Contents

• Invited talk: Algorithms for Geometric SimilarityPankaj Agarwal. 9 [doi]
• Visibility Monotonic Polygon DeflationProsenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin. 11-16 [doi]
• Common Developments of Three Different Orthogonal BoxesToshihiro Shirakawa, Ryuhei Uehara. 17-22 [doi]
• Unfolding Rectangle-Faced OrthostacksErin W. Chambers, Kyle Sykes, Cynthia Traub. 23-28 [doi]
• A Data Structure Supporting Exclusion Persistence Range SearchStuart A. Macgillivray, Bradford G. Nickerson. 29-34 [doi]
• xy-Monotone Path Existence Queries in a Rectilinear EnvironmentGregory Bint, Anil Maheshwari, Michiel H. M. Smid. 35-40 [doi]
• Covering Points with Disjoint Unit DisksGreg Aloupis, Robert A. Hearn, Hirokazu Iwasawa, Ryuhei Uehara. 41-46 [doi]
• The Approximability and Integrality Gap of Interval Stabbing and Independence ProblemsShalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe. 47-52 [doi]
• The Within-Strip Discrete Unit Disk Cover ProblemRobert Fraser, Alejandro López-Ortiz. 53-58 [doi]
• The Cover Contact Graph of Discs Touching a LineStephane Durocher, Saeed Mehrabi 0001, Matthew Skala, Mohammad Abdul Wahid. 59-64 [doi]
• On Piercing (Pseudo)Lines and BoxesB. V. Subramanya Bharadwaj, Chintan Rao, Pradeesha Ashok, Sathish Govindarajan. 65-70 [doi]
• Adaptive Techniques to find Optimal Planar BoxesJérémy Barbay, Gonzalo Navarro, Pablo Pérez-Lantero. 71-76 [doi]
• A Fast Dimension-Sweep Algorithm for the Hypervolume Indicator in Four DimensionsAndreia P. Guerreiro, Carlos M. Fonseca, Michael T. M. Emmerich. 77-82 [doi]
• An Efficient Transformation for the Klee's Measure Problem in the Streaming ModelGokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan. 83-88 [doi]
• Finding Shadows among DisksNatasa Jovanovic, Jan H. M. Korst, Zharko Aleksovski, Wil Michiels, Johan Lukkien, Emile H. L. Aarts. 89-94 [doi]
• Computing the Coverage of an Opaque ForestAlexis Beingessner, Michiel H. M. Smid. 95-100 [doi]
• Disk Constrained 1-Center QueriesLuis Felipe Barba Flores. 107-112 [doi]
• Circle Separability Queries in Logarithmic TimeLuis Felipe Barba Flores, Stefan Langerman, Greg Aloupis. 113-118 [doi]
• Flip Distance Between Two Triangulations of a Point Set is NP-completeAnna Lubiw, Vinayak Pathak. 119-124 [doi]
• Steiner Reducing Sets of Minimum Weight TriangulationsCynthia Traub. 125-130 [doi]
• On the Space Efficiency of the "Ultimate Planar Convex Hull Algorithm"Jan Vahrenhold. 131-136 [doi]
• Divide-and-Conquer 3D Convex Hulls on the GPUJeffrey M. White, Kevin A. Wortman. 137-142 [doi]
• Basis Enumeration of Hyperplane Arrangements Up to SymmetriesAaron Moss, David Bremner. 143-148 [doi]
• Hardness Results for Computing Optimal Locally Gabriel GraphsAbhijeet Khopkar, Sathish Govindarajan. 149-154 [doi]
• Edge Guards for Polyhedra in 3-SpaceJavier Cano, Csaba D. Tóth, Jorge Urrutia. 155-160 [doi]
• Hidden Mobile Guards in Simple PolygonsSarah Cannon, Diane L. Souvaine, Andrew Winslow. 161-166 [doi]
• The Complexity of Guarding Monotone PolygonsErik Krohn, Bengt J. Nilsson. 167-172 [doi]
• Kinematic Joint Recognition in CAD Constraint SystemsAudrey Lee-St. John. 173-178 [doi]
• Computing Motorcycle Graphs Based on Kinetic TriangulationsWilli Mann, Martin Held, Stefan Huber. 179-184 [doi]
• Variable Radii Poisson Disk SamplingScott A. Mitchell, Alexander Rand, Mohamed S. Ebeida, Chandrajit L. Bajaj. 185-190 [doi]
• Invited talk: Cannons at SparrowsGünter M. Ziegler. 191 [doi]
• A Note on Interference in Random NetworksLuc Devroye, Pat Morin. 193-198 [doi]
• On Farthest-Point Information in NetworksProsenjit Bose, Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Michiel H. M. Smid. 199-204 [doi]
• Tight Linear Lower Memory Bound for Local Routing in Planar DigraphsMaia Fraser. 205-210 [doi]
• Packing Trominoes is NP-Complete, #P-Complete and ASP-CompleteTakashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara. 211-216 [doi]
• Tiling Polyhedra with TetrahedraBraxton Carrigan, András Bezdek. 217-222 [doi]
• Point-Set Embedding in Three DimensionsStephen K. Wismath, Henk Meijer. 223-228 [doi]
• Approximating Majority DepthDan Chen, Pat Morin. 229-234 [doi]
• Flexible Crystal FrameworksCiprian Borcea, Ileana Streinu. 235-240 [doi]
• Characterizing Delaunay Graphs via Fixed Point TheoremTomomi Matsui, Yuichiro Miyamoto. 241-246 [doi]
• Lower Bounds for the Number of Small Convex k-HolesOswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber. 247-252 [doi]
• What makes a Tree a Straight Skeleton?Oswin Aichholzer, Howard Cheng, Satyan L. Devadoss, Thomas Hackl, Stefan Huber, Brian Li, Andrej Risteski. 253-258 [doi]
• 3D Skeletonization as an Optimization ProblemDenis Khromov, Leonid Mestetskiy. 259-264 [doi]
• Dynamic Computational Topology for Piecewise Linear CurvesHugh P. Cassidy, Thomas J. Peters, Kirk E. Jordan. 265-270 [doi]
• Finding a Lost Treasure in Convex Hull of Points From Known DistancesBahman Kalantari. 271-276 [doi]
• Optimal Average Case Strategy for Looking Around a CornerReza Dorrigiv, Alejandro López-Ortiz, Selim Tawfik. 277-282 [doi]
• Invited talk: Computational Geometry in Air Traffic ManagementJoseph S. B. Mitchell. 283 [doi]
• Competitive Routing on a Bounded-Degree Plane SpannerProsenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. 285-290 [doi]
• Optimal Bounds on Theta-Graphs: More is not Always BetterProsenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot. 291-296 [doi]
• Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point SetsGlencora Borradaile, David Eppstein. 297-302 [doi]
• On the Strengthening of Topological Signals in Persistent Homology through Vector Bundle Based MapsEric M. Hanson, Francis Motta, Chris Peterson, Lori Ziegelmeier. 303-308 [doi]
• A Multicover Nerve for Geometric InferenceDonald Sheehy. 309-314 [doi]