default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th SCG 2009: Aarhus, Denmark
- John Hershberger, Efi Fogel:
Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009. ACM 2009, ISBN 978-1-60558-501-7
Monday, June 8th, 9: 00-10: 20 am
- Boris Bukh, Jirí Matousek, Gabriel Nivasch
:
Lower bounds for weak epsilon-nets and stair-convexity. 1-10 - Kasturi R. Varadarajan:
Epsilon nets and union complexity. 11-16 - Nabil H. Mustafa, Saurabh Ray:
PTAS for geometric hitting set problems via local search. 17-22 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-linear approximation algorithms for geometric hitting sets. 23-32
Monday, June 8th, 10: 50-11: 50 am
- Bernd Gärtner, Martin Jaggi:
Coresets for polytope distance. 33-42 - Mohammad Ali Abam, Mark de Berg:
Kinetic spanners in Rd. 43-50 - Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth:
Shooting permanent rays among disjoint polygons in the plane. 51-60
Monday, June 8th, 1: 30-2: 30 pm
- Bernard Chazelle, Wolfgang Mulzer:
Computing hereditary convex structures. 61-70 - Csaba D. Tóth:
Binary plane partitions for disjoint line segments. 71-79 - Timothy M. Chan, Eric Y. Chen:
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. 80-87
Video and multimedia presentations
- Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza:
An IP solution to the art gallery problem. 88-89 - Scott Hine, F. Betül Atalay, Dianna Xu, Suneeta Ramaswami:
Quadrilateral meshes with bounded minimum angle. 90-91 - Matthew T. Dickerson, David Eppstein:
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). 92-93 - Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser:
The scale axis picture show. 94-95 - Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek:
Rectangular cartograms: the game. 96-97 - Peter B. Noël, Jinhui Xu, Kenneth R. Hoffmann, Jason J. Corso:
Geometric tomography: a limited-view approach for computed tomography. 98-99 - Gill Barequet, Amir Vaxman:
Straight skeletons of three-dimensional polyhedra. 100-101 - Joseph S. B. Mitchell, Eli Packer:
Reconstructing sharp features of triangular meshes. 102-103 - Nader Salman, Mariette Yvinec:
High resolution surface reconstruction from overlapping multiple-views. 104-105
Monday, June 8 - 4: 40-5: 40 pm
- Joachim Giesen, Balint Miklos, Mark Pauly, Camille Wormser:
The scale axis transform. 106-115 - Chuanjiang Luo, Jian Sun, Yusu Wang:
Integral estimation from point cloud in d-dimensional space: a geometric view. 116-124 - Tamal K. Dey, Kuiyu Li:
Cut locus and topology from surface point data. 125-134
Tuesday, June 9, 9: 00-10: 20am
- Roel Apfelbaum, Micha Sharir:
An improved bound on the number of unit area triangles. 135-140 - Rom Pinchasi:
Halving lines and measure concentration in the plane. 141-147 - Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen:
Candle in the woods: asymptotic bounds on minimum blocking sets. 148-152 - Gary L. Miller, Donald R. Sheehy:
Approximate center points with proofs. 153-158 - Robert J. Lang:
Computational origami: from flapping birds to space telescopes. 159-162
Tuesday, June 9, 1: 30-1: 30pm
- Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility maps of realistic terrains have linear smoothed complexity. 163-168 - Marc J. van Kreveld, Rodrigo I. Silveira:
Embedding rivers in polyhedral terrains. 169-178 - Andrea Francke, Michael Hoffmann:
The Euclidean degree-4 minimum spanning tree problem is NP-hard. 179-188
Tuesday, June 9, 3: 00-4: 20 pm
- Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl:
Divide-and-conquer for Voronoi diagrams revisited. 189-197 - Sang Won Bae, Kyung-Yong Chwa:
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. 198-207 - Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus:
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. 208-216 - Vicente H. F. Batista, David L. Millman, Sylvain Pion, Johannes Singler:
Parallel geometric algorithms for multi-core computers. 217-226
Tuesday, June 9, 4: 40-5: 40pm
- Vin de Silva, Mikael Vejdemo-Johansson:
Persistent cohomology and circular coordinates. 227-236 - Frédéric Chazal, David Cohen-Steiner, Marc Glisse, Leonidas J. Guibas, Steve Oudot:
Proximity of persistence modules and their diagrams. 237-246 - Gunnar E. Carlsson, Vin de Silva, Dmitriy Morozov:
Zigzag persistent homology and real-valued functions. 247-256
Wednesday, June 10, 9: 00-10: 20am
- Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt:
Distributed vision with smart pixels. 257-266 - David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-universal rectangular layouts. 267-276 - Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-oblivious range reporting with optimal queries requires superlinear space. 277-286 - Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. 287-295
Wednesday, June 10, 10: 50-11: 50 am
- Naoki Katoh, Shin-ichi Tanigawa:
A proof of the molecular conjecture. 296-305 - Gaiane Panina, Ileana Streinu:
Flattening single-vertex origami: the non-expansive case. 306-313 - Luc Habert, Michel Pocchiola:
Arrangements of double pseudolines: extended abstract. 314-323
Wednesday, June 10, 1: 30-2: 30pm
- Andrea Vattani:
k-means requires exponentially many iterations even in the plane. 324-332 - Timothy M. Chan, Sariel Har-Peled:
Approximation algorithms for maximum independent set of pseudo-disks. 333-340 - Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multi-cover problem in geometric settings. 341-350
Wednesday, June 10, 3: 00-4: 20pm
- Long Lin, Chee-Keng Yap:
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. 351-360 - Jin-San Cheng, Sylvain Lazard, Luis Mariano Peñaranda, Marc Pouget, Fabrice Rouillier, Elias P. Tsigaridas:
On the topology of planar algebraic curves. 361-370 - Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos:
Randomly removing g handles at once. 371-376 - Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Minimum cuts and shortest homologous cycles. 377-385
Wednesday, June 10, 4: 40-5: 40 pm
- Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß:
Diameter of polyhedra: limits of abstraction. 386-392 - Francis Y. L. Chin, Zeyu Guo, He Sun:
Minimum Manhattan network is NP-complete. 393-402 - Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. 403-412
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-10-31 20:21 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:
