default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd SoCG 2017: Brisbane, QLD, Australia
- Boris Aronov, Matthew J. Katz:
33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia. LIPIcs 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-038-5 - Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors. 0:i-0:xviii
- Vanessa Robins:
The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots (Invited Talk). 1:1-1:1 - Micha Sharir:
The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk). 2:1-2:1 - Mikkel Abrahamsen
, Anna Adamaszek, Tillmann Miltzow:
Irrational Guards are Sometimes Needed. 3:1-3:15 - Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. 4:1-4:15 - Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. 5:1-5:16 - Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg, Christian Wulff-Nilsen:
Best Laid Plans of Lions and Men. 6:1-6:16 - Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao:
Faster Algorithms for the Geometric Transportation Problem. 7:1-7:16 - Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyncl, Irene Parada, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber:
A Superlinear Lower Bound on the Number of 5-Holes. 8:1-8:16 - Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta, Fabrizio Montecchiani:
A Universal Slope Set for 1-Bend Planar Drawings. 9:1-9:16 - Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal epsilon-Kernel Construction and Related Problems. 10:1-10:15 - Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. 11:1-11:15 - Martin Balko, Josef Cibulka, Pavel Valtr:
Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. 12:1-12:16 - Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. 13:1-13:15 - Lukas Barth, Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings. 14:1-14:16 - Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf:
On the Number of Ordinary Lines Determined by Sets in Complex Space. 15:1-15:15 - Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On Optimal 2- and 3-Planar Graphs. 16:1-16:16 - Daniel Binham, Pedro Machado Manhães de Castro, Antoine Vigneron:
Reachability in a Planar Subdivision with Direction Constraints. 17:1-17:15 - Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. 18:1-18:16 - Jean-Daniel Boissonnat, Mael Rouxel-Labbé, Mathijs Wintraecken:
Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams. 19:1-19:16 - Édouard Bonnet, Tillmann Miltzow:
An Approximation Algorithm for the Art Gallery Problem. 20:1-20:15 - Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-Approaching Paths in Simple Polygons. 21:1-21:15 - Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. 22:1-22:15 - Mickaël Buchet, Tamal K. Dey, Jiayuan Wang, Yusu Wang:
Declutter and Resample: Towards Parameter Free Denoising. 23:1-23:16 - Karthik C. S., Arpan Saha:
Ham Sandwich is Equivalent to Borsuk-Ulam. 24:1-24:15 - Mathieu Carrière, Steve Oudot:
Local Equivalence and Intrinsic Metrics between Reeb Graphs. 25:1-25:15 - Timothy M. Chan:
Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry. 26:1-26:15 - Timothy M. Chan:
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back. 27:1-27:15 - Timothy M. Chan, Konstantinos Tsakalidis:
Dynamic Orthogonal Range Searching on the RAM, Revisited. 28:1-28:13 - Yi-Jun Chang, Hsu-Chun Yen:
On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs. 29:1-29:15 - Siu-Wing Cheng, Man-Kit Lau:
Adaptive Planar Point Location. 30:1-30:15 - Man-Kwun Chiu, Matias Korman:
High Dimensional Consistent Digital Segments. 31:1-31:15 - Gui Citovsky, Tyler Mayer, Joseph S. B. Mitchell:
TSP With Locational Uncertainty: The Adversarial Model. 32:1-32:16 - Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati:
On Planar Greedy Drawings of 3-Connected Planar Graphs. 33:1-33:16 - Erik D. Demaine, Tomohiro Tachi:
Origamizer: A Practical Algorithm for Folding Any Polyhedron. 34:1-34:16 - Vincent Despré, Francis Lazarus:
Computing the Geometric Intersection Number of Curves. 35:1-35:15 - Tamal K. Dey, Facundo Mémoli, Yusu Wang:
Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers. 36:1-36:16 - Anne Driemel, Francesco Silvestri:
Locality-Sensitive Hashing of Curves. 37:1-37:16 - Kunal Dutta, Arijit Ghosh, Bruno Jartoux, Nabil H. Mustafa:
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning. 38:1-38:15 - Herbert Edelsbrunner, Hubert Wagner:
Topological Data Analysis with Bregman Divergences. 39:1-39:16 - Khaled M. Elbassioni:
Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension. 40:1-40:15 - Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. 41:1-41:15 - Chenglin Fan, Benjamin Raichel:
Computing the Fréchet Gap Distance. 42:1-42:16 - Jacob Fox, János Pach, Andrew Suk:
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. 43:1-43:15 - Iordan Iordanov, Monique Teillaud:
Implementing Delaunay Triangulations of the Bolza Surface. 44:1-44:15 - Assimakis Kattis, Aleksandar Nikolov:
Lower Bounds for Differential Privacy from Gaussian Width. 45:1-45:16 - Michael Kerber, Robert Tichy, Mario Weitzer:
Constrained Triangulations, Volumes of Polytopes, and Unit Equations. 46:1-46:15 - Balázs Keszegh, Dömötör Pálvölgyi:
Proper Coloring of Geometric Hypergraphs. 47:1-47:15 - Maarten Kleinhans, Marc J. van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann, Kevin Verbeek:
Computing Representative Networks for Braided Rivers. 48:1-48:16 - Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. 49:1-49:15 - Assaf Naor:
A Spectral Gap Precludes Low-Dimensional Embeddings. 50:1-50:16 - Eunjin Oh, Hee-Kap Ahn:
Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons. 51:1-51:15 - Eunjin Oh, Hee-Kap Ahn:
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon. 52:1-52:15 - Srinivasan Parthasarathy, David Sivakoff, Minghao Tian, Yusu Wang:
A Quest to Unravel the Metric Structure Behind Perturbed Networks. 53:1-53:16 - Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. 54:1-54:16 - Saladi Rahul:
Approximate Range Counting Revisited. 55:1-55:15 - Alexandre Rok, Bartosz Walczak:
Coloring Curves That Cross a Fixed Curve. 56:1-56:15 - Michael Kerber, Hannah Schreiber:
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. 57:1-57:16 - Anastasios Sidiropoulos, Vijay Sridhar:
Algorithmic Interpretations of Fractal Dimension. 58:1-58:16 - János Pach, Gábor Tardos, Géza Tóth:
Disjointness Graphs of Segments. 59:1-59:15 - Haitao Wang:
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. 60:1-60:16 - Haitao Wang:
Quickest Visibility Queries in Polygonal Domains. 61:1-61:16 - Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, An Nguyen:
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). 62:1-62:5 - Sander Beekhuis, Kevin Buchin, Thom Castermans, Thom Hurks, Willem Sonke:
Ruler of the Plane - Games of Geometry (Multimedia Contribution). 63:1-63:5 - Kevin Buchin, Jinhee Chun, Maarten Löffler, Aleksandar Markovic, Wouter Meulemans, Yoshio Okamoto, Taichi Shiitada:
Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution). 64:1-64:5 - Chao Chen, Dimitris N. Metaxas, Yusu Wang, Pengxiang Wu:
Cardiac Trabeculae Segmentation: an Application of Computational Topology (Multimedia Contribution). 65:1-65:4 - Michael Joswig, Georg Loho, Benjamin Lorenz, Rico Raber:
MatchTheNet - An Educational Game on 3-Dimensional Polytopes (Multimedia Contribution). 66:1-66:5 - Frank Nielsen, Laëtitia Shao:
On Balls in a Hilbert Polygonal Geometry (Multimedia Contribution). 67:1-67:4
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 2024-11-08 20:39 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:
