Table of Contents

• Geometric Models for Musical Audio DataPaul Bendich, Ellen Gasparovic, John Harer, Christopher J. Tralie. [doi]
• On Variants of k-means ClusteringSayan Bandyapadhyay, Kasturi R. Varadarajan. [doi]
• New Lower Bounds for epsilon-NetsAndrey Kupavskii, Nabil H. Mustafa, János Pach. [doi]
• Shortest Path Embeddings of Graphs on SurfacesAlfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer. [doi]
• Finding Global Optimum for Truth Discovery: Entropy Based Geometric VarianceHu Ding, Jing Gao, Jinhui Xu. [doi]
• Tight Lower Bounds for Data-Dependent Locality-Sensitive HashingAlexandr Andoni, Ilya Razensteyn. [doi]
• On the Combinatorial Complexity of Approximating PolytopesSunil Arya, Guilherme Dias da Fonseca, David M. Mount. [doi]
• Recognizing Weakly Simple PolygonsHugo Alves Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth. [doi]
• All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded GraphsGlencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen. [doi]
• Degree Four Plane Spanners: Simpler and BetterIyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu. [doi]
• Inserting Multiple Edges into a Planar GraphMarkus Chimani, Petr Hlinený. [doi]
• Dimension Reduction Techniques for l_p (1<p<2), with ApplicationsYair Bartal, Lee-Ad Gottlieb. [doi]
• Finding the Maximum Subset with Bounded Convex CurvatureMikkel Abrahamsen, Mikkel Thorup. [doi]
• Separating a Voronoi Diagram via Local SearchVijay V. S. P. Bhattiprolu, Sariel Har-Peled. [doi]
• A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a PolyominoStefan Langerman, Andrew Winslow. [doi]
• Approximating Dynamic Time Warping and Edit Distance for a Pair of Point SequencesPankaj K. Agarwal, Kyle Fox, Jiangwei Pan, Rex Ying. [doi]
• Toward Pervasive Robots (Invited Talk)Daniela Rus. [doi]
• Delaunay Triangulations on Orientable Surfaces of Low GenusMikhail Bogdanov, Monique Teillaud, Gert Vegter. [doi]
• Untangling Planar CurvesHsien-Chih Chang, Jeff Erickson. [doi]
• High-Dimensional Geometry of Sliding Window Embeddings of Periodic VideosChristopher J. Tralie. [doi]
• Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence ProblemsFedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. [doi]
• Convergence between Categorical Representations of Reeb Space and MapperElizabeth Munch, Bei Wang. [doi]
• Congruence Testing of Point Sets in 4-SpaceHeuna Kim, Günter Rote. [doi]
• Random Sampling with RemovalBernd Gärtner, Johannes Lengler, May Szedlák. [doi]
• Weak 1/r-Nets for Moving PointsAlexandre Rok, Shakhar Smorodinsky. [doi]
• Hyperplane Separability and Convexity of Probabilistic Point SetsMartin Fink 0001, John Hershberger, Nirman Kumar, Subhash Suri. [doi]
• The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd SimulationWouter van Toll, Atlas F. Cook IV, Marc J. van Kreveld, Roland Geraerts. [doi]
• Minimum Cycle and Homology Bases of Surface Embedded GraphsGlencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri. [doi]
• Anchored Rectangle and Square PackingsKevin Balas, Adrian Dumitrescu, Csaba D. Tóth. [doi]
• Strongly Monotone Drawings of Planar GraphsStefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher. [doi]
• Path Planning for Simple Robots using Soft Subdivision SearchChing-Hsiang Hsu, John Paul Ryan, Chee Yap. [doi]
• Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors [doi]
• Visualizing Scissors CongruenceSatyan Devadoss, Ziv Epstein, Dmitriy Smirnov. [doi]
• Dynamic Streaming Algorithms for Epsilon-KernelsTimothy M. Chan. [doi]
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related ProblemsDániel Marx, Tillmann Miltzow. [doi]
• On the Separability of Stochastic Geometric Objects, with ApplicationsJie Xue, Yuan Li, Ravi Janardan. [doi]
• Introduction to Persistent HomologyMatthew L. Wright. [doi]
• Simultaneous Nearest Neighbor SearchPiotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan. [doi]
• On Visibility Representations of Non-Planar GraphsTherese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani. [doi]
• On Expansion and Topological OverlapDominic Dotterrer, Tali Kaufman, Uli Wagner. [doi]
• Finding Non-Orientable Surfaces in 3-ManifoldsBenjamin A. Burton, Arnaud de Mesmay, Uli Wagner. [doi]
• Max-Sum Diversity Via Convex ProgrammingAlfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen. [doi]
• Testing Convexity of Figures Under the Uniform DistributionPiotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. [doi]
• Grouping Time-Varying Data for Interactive ExplorationArthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals. [doi]
• Faster Algorithms for Computing Plurality PointsMark de Berg, Joachim Gudmundsson, Mehran Mehr. [doi]
• Who Needs Crossings? Hardness of Plane Graph RigidityZachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl. [doi]
• Approximating Convex Shapes With Respect to Symmetric Difference Under HomothetiesJuyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson. [doi]
• Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable RangeIsaac Mabillard, Uli Wagner. [doi]
• On the Complexity of Minimum-Link Path ProblemsIrina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals. [doi]
• Discrete Geometry, Algebra, and Combinatorics (Invited Talk)Jacob Fox. [doi]
• Exploring Circle Packing AlgorithmsKevin Pratt, Connor Riley, Donald Sheehy. [doi]
• Fixed Points of the Restricted Delaunay Triangulation OperatorMarc Khoury, Jonathan Richard Shewchuk. [doi]
• The Number of Holes in the Union of Translates of a Convex Set in Three DimensionsBoris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc. [doi]
• Structure and Stability of the 1-Dimensional MapperMathieu Carrière, Steve Oudot. [doi]
• Applications of Incidence Bounds in Point Covering ProblemsPeyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen. [doi]
• An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi DiagramsCecilia Bohler, Rolf Klein, Chih-Hung Liu. [doi]
• Qualitative Symbolic PerturbationOlivier Devillers, Menelaos Karavelas, Monique Teillaud. [doi]
• A Lower Bound on Opaque SetsAkitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach. [doi]
• Coloring Points with Respect to SquaresEyal Ackerman, Balázs Keszegh, Máté Vizer. [doi]
• Efficient Algorithms to Decide TightnessBhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, Jonathan Spreer. [doi]
• The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple PolygonEunjin Oh, Luis Barba, Hee-Kap Ahn. [doi]
• Configurations of Lines in 3-Space and Rigidity of Planar StructuresOrit E. Raz. [doi]
• Incremental Voronoi diagramsSarah R. Allen, Luis Barba, John Iacono, Stefan Langerman. [doi]
• An Improved Lower Bound on the Minimum Number of TriangulationsOswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, Birgit Vogtenhuber. [doi]
• Interactive Geometric Algorithm Visualization in a BrowserKirk Gardner, Lynn Asselin, Donald Sheehy. [doi]
• On the Number of Maximum Empty Boxes Amidst n PointsAdrian Dumitrescu, Minghui Jiang. [doi]
• Two Approaches to Building Time-Windowed Geometric Data StructuresTimothy M. Chan, Simon Pratt. [doi]
• Polynomial-Sized Topological Approximations Using the PermutahedronAruni Choudhary, Michael Kerber, Sharath Raghvendra. [doi]
• Crossing Number is Hard for KernelizationPetr Hlinený, Marek Dernár. [doi]
• Avoiding the Global Sort: A Faster Contour Tree AlgorithmBenjamin Raichel, C. Seshadhri. [doi]
• The Planar Tree Packing TheoremMarkus Geyer, Michael Hoffmann, Michael Kaufmann 0001, Vincent Kusters, Csaba D. Tóth. [doi]
• On Computing the Fréchet Distance Between SurfacesAmir Nayyeri, Hanzhong Xu. [doi]
• Visualization of Geometric Spanner AlgorithmsMohammad Farshi, Seyed Hossein Hosseini. [doi]