Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth |
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 9:1-9:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Peter Schäfer |
Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 66:1-66:5, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Drago Bokal, Zdenek Dvorák 0001, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera |
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 14:1-14:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Niedermann, Ignaz Rutter, Matthias Wolf 0004 |
Efficient Algorithms for Ortho-Radial Graph Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 53:1-53:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Micha Sharir, Chen Ziv |
On the Complexity of the k-Level in Arrangements of Pseudoplanes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 62:1-62:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sariel Har-Peled, Mitchell Jones |
Journey to the Center of the Point Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 41:1-41:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Bhaskar Ray Chaudhury |
Polyline Simplification has Cubic Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 18:1-18:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Schnider |
Ham-Sandwich Cuts and Center Transversals in Subspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 56:1-56:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
Searching for the Closest-Pair in a Query Translate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 61:1-61:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vida Dujmovic, Pat Morin |
Dual Circumference and Collinear Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 29:1-29:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mathieu Carrière, Ulrich Bauer |
On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 21:1-21:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer |
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 26:1-26:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer |
The Unbearable Hardness of Unknotting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 49:1-49:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Sariel Har-Peled |
Smallest k-Enclosing Rectangle Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 23:1-23:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gill Barequet, Yusu Wang 0001 (eds.) |
35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Kristóf Huszár, Jonathan Spreer |
3-Manifold Triangulations with Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 44:1-44:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | J. Ian Munro, Yakov Nekrich |
Dynamic Planar Point Location in External Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 52:1-52:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud |
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 40:1-40:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani |
Upward Book Embeddings of st-Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 13:1-13:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jacob Fox, János Pach, Andrew Suk |
Semi-Algebraic Colorings of Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 36:1-36:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein |
Cubic Planar Graphs That Cannot Be Drawn On Few Lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 32:1-32:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Daniel Boissonnat, Siddharth Pritam |
Computing Persistent Homology of Flag Complexes via Strong Collapses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 55:1-55:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan |
Dynamic Geometric Data Structures via Shallow Cuttings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 24:1-24:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | János Pach, István Tomon |
On the Chromatic Number of Disjointness Graphs of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 54:1-54:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr 0001, Uli Wagner 0001 |
The Crossing Tverberg Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 38:1-38:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kevin Buchin, Sariel Har-Peled, Dániel Oláh |
A Spanner for the Day After. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 19:1-19:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amer Krivosija, Alexander Munteanu |
Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 47:1-47:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ulderico Fugacci, Michael Kerber |
Chunk Reduction for Multi-Parameter Persistent Homology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 37:1-37:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 0:1-0:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Marvin Künnemann, André Nusser |
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 17:1-17:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao |
Efficient Algorithms for Geometric Partial Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 6:1-6:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer |
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 63:1-63:6, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov |
Preconditioning for the Geometric Transportation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 15:1-15:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson 0001 |
Lower Bounds for Electrical Reduction on Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 25:1-25:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl |
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 8:1-8:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, Yuhei Umeda |
DTM-Based Filtrations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 58:1-58:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Bruce Randall Donald |
Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 2:1-2:1, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mozhgan Mirzaei, Andrew Suk |
On Grids in Point-Line Arrangements in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 50:1-50:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sergio Cabello, Timothy M. Chan |
Computing Shapley Values in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 20:1-20:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sanjoy Dasgupta |
A Geometric Data Structure from Neuroscience (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 1:1-1:1, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Peyman Afshani, Jeff M. Phillips |
Independent Range Sampling, Revisited Again. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 4:1-4:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Adrian Dumitrescu |
A Product Inequality for Extreme Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 30:1-30:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl |
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 5:1-5:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jeff Erickson 0001, Yipu Wang |
Topologically Trivial Closed Walks in Directed Surface Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 34:1-34:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Maarten Löffler |
A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 65:1-65:2, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Ziga Virk, Hubert Wagner |
Topological Data Analysis in Information Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 31:1-31:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann |
Preprocessing Ambiguous Imprecise Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 42:1-42:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Yufei Tao 0001, Yu Wang |
Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 57:1-57:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Wang 0001 |
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 59:1-59:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Wang 0001, Jie Xue 0003 |
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 60:1-60:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kerber, Michael Lesnick, Steve Oudot |
Exact Computation of the Matching Distance on 2-Parameter Persistence Modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 46:1-46:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shay Moran, Amir Yehudayoff |
On Weak epsilon-Nets and the Radon Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 51:1-51:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sándor P. Fekete, Phillip Keldenich, Christian Scheffer |
Packing Disks into Disks with Optimal Worst-Case Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 35:1-35:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Nathaniel Lahn, Sharath Raghvendra |
A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 48:1-48:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Luis Barba |
Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 12:1-12:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 27:1-27:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gill Barequet, Gil Ben-Shachar |
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 64:1-64:4, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli |
Morphing Contact Representations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 10:1-10:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dominique Attali, André Lieutier, David Salinas |
When Convexity Helps Collapsing Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 11:1-11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Peyman Afshani |
A New Lower Bound for Semigroup Orthogonal Range Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 3:1-3:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Eppstein |
Counting Polygon Triangulations is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 33:1-33:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos |
Algorithms for Metric Learning via Contrastive Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 45:1-45:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, Lin F. Yang |
The One-Way Communication Complexity of Dynamic Time Warping Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 16:1-16:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Radoslav Fulek, Jan Kyncl |
Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 39:1-39:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh 0001, Meirav Zehavi |
Connecting the Dots (with Minimum Crossings). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 7:1-7:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot |
Convex Polygons in Cartesian Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 22:1-22:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Anne Driemel, Jeff M. Phillips, Ioannis Psarros |
The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 28:1-28:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Haitao Wang 0001, Jingru Zhang |
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 72:1-72:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | János Pach, Bruce A. Reed, Yelena Yuditsky |
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 68:1-68:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kristóf Huszár, Jonathan Spreer, Uli Wagner 0001 |
On the Treewidth of Triangulated 3-Manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 46:1-46:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin A. Burton |
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 18:1-18:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Dani Demas, Satyan L. Devadoss, Yu Xuan Hong |
Star Unfolding of Boxes (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 76:1-76:4, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Kolja Junginger, Evanthia Papadopoulou |
Deletion in Abstract Voronoi Diagrams in Expected Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 50:1-50:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner 0001 |
Shellability is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 41:1-41:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eunjin Oh 0001, Hee-Kap Ahn |
Point Location in Dynamic Planar Subdivisions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 63:1-63:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi |
Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 1:1-1:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jie Xue 0003, Yuan Li 0013, Saladi Rahul, Ravi Janardan |
New Bounds for Range Closest-Pair Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 73:1-73:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang 0001, Yusu Wang 0001, Lori Ziegelmeier |
Vietoris-Rips and Cech Complexes of Metric Gluings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 3:1-3:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Haas |
Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 44:1-44:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, Natan Rubin |
Further Consequences of the Colorful Helly Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 59:1-59:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Herbert Edelsbrunner, Georg Osang |
The Multi-cover Persistence of Euclidean Balls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 34:1-34:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Daniel Boissonnat, André Lieutier, Mathijs Wintraecken |
The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 10:1-10:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Håvard Bakke Bjerkevik, Magnus Bakke Botnan |
Computational Complexity of the Interleaving Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 13:1-13:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marc J. van Kreveld, Maarten Löffler, Lionov Wiratma |
On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 56:1-56:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Pankaj K. Agarwal, Lars Arge, Frank Staals |
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 4:1-4:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Chih-Hung Liu 0001 |
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 58:1-58:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jonathan Spreer, Stephan Tillmann |
The Trisection Genus of Standard Simply Connected PL 4-Manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 71:1-71:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Frédéric Chazal, Vincent Divol |
The Density of Expected Persistence Diagrams and its Kernel Based Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 26:1-26:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer |
Coordinated Motion Planning: The Video (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 74:1-74:6, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tanmay Inamdar 0002, Kasturi R. Varadarajan |
On Partial Covering For Geometric Set Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 47:1-47:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Dimitrios Skrepetos |
Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 24:1-24:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Chaya Keller, Shakhar Smorodinsky |
From a (p, 2)-Theorem to a Tight (p, q)-Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 51:1-51:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, Mathijs Wintraecken |
Local Criteria for Triangulation of Manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 9:1-9:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport |
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 55:1-55:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tamal K. Dey, Cheng Xin |
Computing Bottleneck Distance for 2-D Interval Decomposable Modules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 32:1-32:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Oliver Roche-Newton |
An Improved Bound for the Size of the Set A/A+A. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 69:1-69:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ryo Ashida, Kotaro Nakagawa |
O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 5:1-5:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Tamal K. Dey, Jiayuan Wang, Yusu Wang 0001 |
Graph Reconstruction by Discrete Morse Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 31:1-31:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Malte Milatz |
Random Walks on Polytopes of Constant Corank. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 60:1-60:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, Ahmad A. Rushdi |
VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 77:1-77:4, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|