default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd SoCG 2016: Boston, MA, USA
- Sándor P. Fekete, Anna Lubiw:
32nd International Symposium on Computational Geometry, SoCG 2016, Boston, MA, USA, June 14-18, 2016. LIPIcs 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-009-5 - Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors. 0:i-0:xviii
- Daniela Rus:
Toward Pervasive Robots (Invited Talk). 1:1-1:1 - Jacob Fox:
Discrete Geometry, Algebra, and Combinatorics (Invited Talk). 2:1-2:1 - Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl:
Who Needs Crossings? Hardness of Plane Graph Rigidity. 3:1-3:15 - Mikkel Abrahamsen
, Mikkel Thorup:
Finding the Maximum Subset with Bounded Convex Curvature. 4:1-4:17 - Eyal Ackerman, Balázs Keszegh, Máté Vizer:
Coloring Points with Respect to Squares. 5:1-5:16 - Pankaj K. Agarwal, Kyle Fox, Jiangwei Pan, Rex Ying:
Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences. 6:1-6:16 - Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, Birgit Vogtenhuber:
An Improved Lower Bound on the Minimum Number of Triangulations. 7:1-7:16 - Hugo A. Akitaya, Greg Aloupis, Jeff Erickson, Csaba D. Tóth:
Recognizing Weakly Simple Polygons. 8:1-8:16 - Alexandr Andoni, Ilya P. Razenshteyn:
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. 9:1-9:11 - Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc:
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. 10:1-10:16 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. 11:1-11:15 - Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, Jonathan Spreer:
Efficient Algorithms to Decide Tightness. 12:1-12:15 - Kevin Balas, Adrian Dumitrescu, Csaba D. Tóth:
Anchored Rectangle and Square Packings. 13:1-13:16 - Sayan Bandyapadhyay, Kasturi R. Varadarajan:
On Variants of k-means Clustering. 14:1-14:15 - Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi diagrams. 15:1-15:16 - Yair Bartal, Lee-Ad Gottlieb:
Dimension Reduction Techniques for ℓp (1<p<2), with Applications. 16:1-16:15 - Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Testing Convexity of Figures Under the Uniform Distribution. 17:1-17:15 - Vijay V. S. P. Bhattiprolu, Sariel Har-Peled:
Separating a Voronoi Diagram via Local Search. 18:1-18:16 - Therese Biedl, Giuseppe Liotta, Fabrizio Montecchiani:
On Visibility Representations of Non-Planar Graphs. 19:1-19:16 - Mikhail Bogdanov, Monique Teillaud, Gert Vegter:
Delaunay Triangulations on Orientable Surfaces of Low Genus. 20:1-20:17 - Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. 21:1-21:15 - Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. 22:1-22:16 - Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum Cycle and Homology Bases of Surface Embedded Graphs. 23:1-23:15 - Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding Non-Orientable Surfaces in 3-Manifolds. 24:1-24:15 - Mathieu Carrière, Steve Oudot:
Structure and Stability of the 1-Dimensional Mapper. 25:1-25:16 - Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen:
Max-Sum Diversity Via Convex Programming. 26:1-26:14 - Timothy M. Chan:
Dynamic Streaming Algorithms for Epsilon-Kernels. 27:1-27:11 - Timothy M. Chan, Simon Pratt:
Two Approaches to Building Time-Windowed Geometric Data Structures. 28:1-28:15 - Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. 29:1-29:16 - Markus Chimani, Petr Hlinený:
Inserting Multiple Edges into a Planar Graph. 30:1-30:15 - Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using the Permutahedron. 31:1-31:16 - Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. 32:1-32:15 - Olivier Devillers, Menelaos Karavelas, Monique Teillaud:
Qualitative Symbolic Perturbation. 33:1-33:17 - Hu Ding, Jing Gao, Jinhui Xu:
Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance. 34:1-34:16 - Dominic Dotterrer, Tali Kaufman, Uli Wagner:
On Expansion and Topological Overlap. 35:1-35:10 - Adrian Dumitrescu, Minghui Jiang:
On the Number of Maximum Empty Boxes Amidst n Points. 36:1-36:13 - Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, Manfred Scheucher:
Strongly Monotone Drawings of Planar Graphs. 37:1-37:15 - Martin Fink, John Hershberger, Nirman Kumar, Subhash Suri:
Hyperplane Separability and Convexity of Probabilistic Point Sets. 38:1-38:16 - Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. 39:1-39:15 - Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. 40:1-40:16 - Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. 41:1-41:15 - Petr Hlinený, Marek Dernár:
Crossing Number is Hard for Kernelization. 42:1-42:10 - Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. 43:1-43:16 - Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. 44:1-44:15 - Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree Four Plane Spanners: Simpler and Better. 45:1-45:15 - Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, János Pach:
A Lower Bound on Opaque Sets. 46:1-46:10 - Marc Khoury, Jonathan Richard Shewchuk:
Fixed Points of the Restricted Delaunay Triangulation Operator. 47:1-47:15 - Heuna Kim, Günter Rote:
Congruence Testing of Point Sets in 4-Space. 48:1-48:16 - Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals:
On the Complexity of Minimum-Link Path Problems. 49:1-49:16 - Stefan Langerman, Andrew Winslow:
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino. 50:1-50:15 - Isaac Mabillard, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range. 51:1-51:12 - Dániel Marx, Tillmann Miltzow:
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems. 52:1-52:16 - Elizabeth Munch, Bei Wang:
Convergence between Categorical Representations of Reeb Space and Mapper. 53:1-53:16 - Andrey Kupavskii, Nabil H. Mustafa, János Pach:
New Lower Bounds for epsilon-Nets. 54:1-54:16 - Amir Nayyeri, Hanzhong Xu:
On Computing the Fréchet Distance Between Surfaces. 55:1-55:15 - Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. 56:1-56:15 - Benjamin Raichel, C. Seshadhri:
Avoiding the Global Sort: A Faster Contour Tree Algorithm. 57:1-57:14 - Orit E. Raz:
Configurations of Lines in 3-Space and Rigidity of Planar Structures. 58:1-58:14 - Alexandre Rok, Shakhar Smorodinsky:
Weak 1/r-Nets for Moving Points. 59:1-59:13 - Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of Incidence Bounds in Point Covering Problems. 60:1-60:15 - Arthur van Goethem, Marc J. van Kreveld, Maarten Löffler, Bettina Speckmann, Frank Staals:
Grouping Time-Varying Data for Interactive Exploration. 61:1-61:16 - Jie Xue, Yuan Li, Ravi Janardan:
On the Separability of Stochastic Geometric Objects, with Applications. 62:1-62:16 - Juyoung Yon, Sang Won Bae, Siu-Wing Cheng, Otfried Cheong, Bryan T. Wilkinson:
Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties. 63:1-63:15 - Kirk P. Gardner, Lynn Asselin, Donald R. Sheehy:
Interactive Geometric Algorithm Visualization in a Browser. 64:1-64:4 - Paul Bendich, Ellen Gasparovic, John Harer, Christopher J. Tralie:
Geometric Models for Musical Audio Data. 65:1-65:5 - Satyan L. Devadoss, Ziv Epstein, Dmitriy Smirnov:
Visualizing Scissors Congruence. 66:1-66:3 - Mohammad Farshi, Seyed Hossein Hosseini:
Visualization of Geometric Spanner Algorithms. 67:1-67:4 - Ching-Hsiang Hsu, John Paul Ryan, Chee Yap:
Path Planning for Simple Robots using Soft Subdivision Search. 68:1-68:5 - Kevin Pratt, Connor Riley, Donald R. Sheehy:
Exploring Circle Packing Algorithms. 69:1-69:4 - Wouter van Toll, Atlas F. Cook IV, Marc J. van Kreveld, Roland Geraerts:
The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation. 70:1-70:5 - Christopher J. Tralie:
High-Dimensional Geometry of Sliding Window Embeddings of Periodic Videos. 71:1-71:5 - Matthew L. Wright:
Introduction to Persistent Homology. 72:1-72:3
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
