default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th SoCG 2019: Portland, OR, USA
- Gill Barequet, Yusu Wang:
35th International Symposium on Computational Geometry, SoCG 2019, Portland, Oregon, USA, June 18-21, 2019. LIPIcs 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-104-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Sanjoy Dasgupta:
A Geometric Data Structure from Neuroscience (Invited Talk). 1:1-1:1 - Bruce Randall Donald:
Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk). 2:1-2:1 - Peyman Afshani:
A New Lower Bound for Semigroup Orthogonal Range Searching. 3:1-3:14 - Peyman Afshani, Jeff M. Phillips:
Independent Range Sampling, Revisited Again. 4:1-4:13 - Pankaj K. Agarwal, Boris Aronov
, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. 5:1-5:14 - Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao:
Efficient Algorithms for Geometric Partial Matching. 6:1-6:14 - Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi:
Connecting the Dots (with Minimum Crossings). 7:1-7:17 - Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. 8:1-8:14 - Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. 9:1-9:17 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. 10:1-10:16 - Dominique Attali, André Lieutier, David Salinas:
When Convexity Helps Collapsing Complexes. 11:1-11:15 - Luis Barba:
Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams. 12:1-12:14 - Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani:
Upward Book Embeddings of st-Graphs. 13:1-13:22 - Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. 14:1-14:15 - Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov:
Preconditioning for the Geometric Transportation Problem. 15:1-15:14 - Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang:
The One-Way Communication Complexity of Dynamic Time Warping Distance. 16:1-16:15 - Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. 17:1-17:21 - Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. 18:1-18:16 - Kevin Buchin, Sariel Har-Peled, Dániel Oláh:
A Spanner for the Day After. 19:1-19:15 - Sergio Cabello, Timothy M. Chan:
Computing Shapley Values in the Plane. 20:1-20:19 - Mathieu Carrière, Ulrich Bauer:
On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. 21:1-21:15 - Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. 22:1-22:17 - Timothy M. Chan, Sariel Har-Peled:
Smallest k-Enclosing Rectangle Revisited. 23:1-23:15 - Timothy M. Chan:
Dynamic Geometric Data Structures via Shallow Cuttings. 24:1-24:13 - Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson:
Lower Bounds for Electrical Reduction on Surfaces. 25:1-25:16 - Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. 26:1-26:15 - Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. 27:1-27:16 - Anne Driemel, Jeff M. Phillips, Ioannis Psarros:
The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. 28:1-28:16 - Vida Dujmovic, Pat Morin:
Dual Circumference and Collinear Sets. 29:1-29:17 - Adrian Dumitrescu:
A Product Inequality for Extreme Distances. 30:1-30:12 - Herbert Edelsbrunner, Ziga Virk, Hubert Wagner:
Topological Data Analysis in Information Space. 31:1-31:14 - David Eppstein:
Cubic Planar Graphs That Cannot Be Drawn On Few Lines. 32:1-32:15 - David Eppstein:
Counting Polygon Triangulations is Hard. 33:1-33:17 - Jeff Erickson, Yipu Wang:
Topologically Trivial Closed Walks in Directed Surface Graphs. 34:1-34:17 - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. 35:1-35:19 - Jacob Fox, János Pach, Andrew Suk:
Semi-Algebraic Colorings of Complete Graphs. 36:1-36:12 - Ulderico Fugacci, Michael Kerber:
Chunk Reduction for Multi-Parameter Persistent Homology. 37:1-37:14 - Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. 38:1-38:13 - Radoslav Fulek, Jan Kyncl:
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. 39:1-39:16 - Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. 40:1-40:16 - Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. 41:1-41:14 - Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann:
Preprocessing Ambiguous Imprecise Points. 42:1-42:16 - Ching-Hsiang Hsu, Yi-Jen Chiang, Chee Yap:
Rods and Rings: Soft Subdivision Planner for R^3 x S^2. 43:1-43:17 - Kristóf Huszár, Jonathan Spreer:
3-Manifold Triangulations with Small Treewidth. 44:1-44:20 - Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos:
Algorithms for Metric Learning via Contrastive Embeddings. 45:1-45:14 - Michael Kerber, Michael Lesnick, Steve Oudot:
Exact Computation of the Matching Distance on 2-Parameter Persistence Modules. 46:1-46:15 - Amer Krivosija, Alexander Munteanu:
Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling. 47:1-47:14 - Nathaniel Lahn, Sharath Raghvendra:
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. 48:1-48:13 - Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
The Unbearable Hardness of Unknotting. 49:1-49:19 - Mozhgan Mirzaei, Andrew Suk:
On Grids in Point-Line Arrangements in the Plane. 50:1-50:11 - Shay Moran, Amir Yehudayoff:
On Weak epsilon-Nets and the Radon Number. 51:1-51:14 - J. Ian Munro, Yakov Nekrich:
Dynamic Planar Point Location in External Memory. 52:1-52:15 - Benjamin Niedermann, Ignaz Rutter, Matthias Wolf:
Efficient Algorithms for Ortho-Radial Graph Drawing. 53:1-53:14 - János Pach, István Tomon:
On the Chromatic Number of Disjointness Graphs of Curves. 54:1-54:17 - Jean-Daniel Boissonnat, Siddharth Pritam:
Computing Persistent Homology of Flag Complexes via Strong Collapses. 55:1-55:15 - Patrick Schnider:
Ham-Sandwich Cuts and Center Transversals in Subspaces. 56:1-56:15 - Yufei Tao, Yu Wang:
Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges. 57:1-57:14 - Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda:
DTM-Based Filtrations. 58:1-58:15 - Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. 59:1-59:14 - Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. 60:1-60:13 - Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the Closest-Pair in a Query Translate. 61:1-61:15 - Micha Sharir, Chen Ziv:
On the Complexity of the k-Level in Arrangements of Pseudoplanes. 62:1-62:15 - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer:
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). 63:1-63:6 - Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). 64:1-64:4 - Maarten Löffler:
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition). 65:1-65:2 - Peter Schäfer:
Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition). 66:1-66:5
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-14 23:09 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:
