default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th SoCG 2013: Rio de Janeiro, Brazil
- Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein:
Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013. ACM 2013, ISBN 978-1-4503-2031-3
Session 1
- Victor Alvarez, Raimund Seidel:
A simple aggregative algorithm for counting triangulations of planar point sets and related problems. 1-8 - R. Sharathkumar:
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates. 9-16 - Antoine Vigneron, Lie Yan
:
A faster algorithm for computing motorcycle graphs. 17-26 - David Eppstein:
The graphs of planar soap bubbles. 27-36
Session 2A
- Jeff Erickson:
Efficiently hex-meshing things with topology. 37-46 - Tamal Krishna Dey, Andrew G. Slatton:
Localized delaunay refinement for piecewise-smooth complexes. 47-56 - Joachim Giesen, Lars Kuehne:
A parallel algorithm for computing the flow complex. 57-66 - Mikhail Bogdanov, Olivier Devillers, Monique Teillaud:
Hyperbolic delaunay complexes and voronoi diagrams made practical. 67-76
Session 2B
- Imre Bárány, Edgardo Roldán-Pensado:
On a forgotten conjecture from a famous paper of Erdös. 77-80 - Josef Cibulka, Jan Kyncl, Pavel Valtr:
On planar point sets with the pentagon property. 81-90 - Pablo Soberón:
Equal coefficients and tolerance in coloured tverberg partitions. 91-96 - Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved bounds for incidences between points and circles. 97-106
Session 3A
- Tamal Krishna Dey, Fengtao Fan, Yusu Wang:
Graph induced complex on point data. 107-116 - Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier:
Homological reconstruction and simplification in R3. 117-126 - Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized complexity of discrete morse theory. 127-136
Session 3B
- Zahed Rahmati, Valerie King, Sue Whitesides:
Kinetic data structures for all nearest neighbors and closest pair in the plane. 137-144 - Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic 2-centers in the black-box model. 145-154 - William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Competitive query strategies for minimising the ply of the potential locations of moving points. 155-164
Session 4: invited talk
- Francisco Santos:
Recent progress on the combinatorial diameter of polyhedra and simplicial complexes. 165-166
Session 5A
- Olivier Devillers, Marc Glisse, Xavier Goaoc:
Complexity analysis of random geometric structures made simpler. 167-176 - Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of random minkowski sums and network vulnerability analysis. 177-186 - Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki:
The maximum number of faces of the minkowski sum of three convex polytopes. 187-196
Session 5B
- James R. Lee, Daniel E. Poore:
On the 2-sum embedding conjecture. 197-206 - Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan:
Diverse near neighbor problem. 207-214 - Elyot Grant, Piotr Indyk:
Compressive sensing using locality-preserving matrices. 215-222
Session 6A
- Amirali Abdullah, Samira Daruki, Jeff M. Phillips:
Range counting coresets for uncertain data. 223-232 - Esther Ezra:
Small-size relative (p, ε)-approximations for well-behaved range spaces. 233-242 - Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue:
A constant-factor approximation for multi-covering with disks. 243-248
Session 6B
- Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and sampling minimum cuts in genus g graphs. 249-258 - Radoslav Fulek, Andres J. Ruiz-Vargas:
Topological graphs: empty triangles and disjoint matchings. 259-266 - Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. 267-276
Session 7: invited talk
- Kenneth Y. Goldberg:
Putting the turing into manufacturing: recent developments in algorithmic automation. 277-280
Session 8A
- Gary L. Miller, Donald R. Sheehy:
A new approach to output-sensitive voronoi diagrams and delaunay triangulations. 281-288 - Gary L. Miller, Donald R. Sheehy, Ameya Velingker:
A fast algorithm for well-spaced points and approximate delaunay graphs. 289-298 - Jonathan Richard Shewchuk, Brielin C. Brown:
Fast segment insertion and incremental construction of constrained delaunay triangulations. 299-308
Session 8B
- David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. 309-318 - Seth Pettie:
Sharp bounds on Davenport-Schinzel sequences of every order. 319-328 - Kyle Klein, Subhash Suri:
Capture bounds for visibility-based pursuit evasion. 329-338
Videos & multimedia
- Gill Barequet, Mira Shalah:
Polyominoes on twisted cylinders. 339-340 - Justin Stoecker, Victor Milenkovic:
Interactive visualization of 3D configuration spaces. 341-342 - Ivaylo Ilinkin:
Parametric search visualization. 343-344 - Aaron T. Becker, Sándor P. Fekete, Alexander Kröller, SeoungKyou Lee, James McLurkin, Christiane Schmidt:
Triangulating unknown environments using robot swarms. 345-346 - Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni:
Point guards and point clouds: solving general art gallery problems. 347-348
Session 10A
- Cong Wang, Yi-Jen Chiang, Chee Yap:
On soft predicates in subdivision motion planning. 349-358 - John Hershberger, Subhash Suri, Hakan Yildiz:
A near-optimal algorithm for shortest paths among curved obstacles in the plane. 359-368 - Danny Z. Chen, Haitao Wang:
Computing shortest paths among curved obstacles in the plane. 369-378 - Sergio Cabello, Panos Giannopoulos:
The complexity of separating points in the plane. 379-386
Session 10B
- Steve Y. Oudot, Donald R. Sheehy:
Zigzag zoology: rips zigzags for homology inference. 387-396 - Vin de Silva, Vidit Nanda:
Geometry in the space of persistence modules. 397-404 - Benjamin A. Burton, Alexander Coward, Stephan Tillmann:
Computing closed essential surfaces in knot complements. 405-414 - Benjamin A. Burton:
A new approach to crushing 3-manifold triangulations. 415-424
Session 11
- Erin Wolf Chambers, Yusu Wang:
Measuring similarity between curves on 2-manifolds via homotopy area. 425-434 - Quentin Mérigot:
Lower bounds for k-distance approximation. 435-440 - Adrian Dumitrescu, Minghui Jiang:
Systems of distant representatives in euclidean space. 441-448 - Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust geometric spanners. 449-458
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-12 01:07 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:
