24. Symposium on Computational Geometry 2008: College Park, MD, USA
Monique Teillaud (Ed.): Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008. ACM 2008 ISBN 978-1-60558-071-5
1
- Timothy M. Chan: Dynamic coresets. 1-9
- Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff: Optimizing active ranges for consistent dynamic map labeling. 10-19
- Esther M. Arkin, Joseph S. B. Mitchell, Valentin Polishchuk: Maximum thick paths in static and dynamic environments. 20-27
- Krzysztof Onak, Anastasios Sidiropoulos: Circular partitions with applications to visualization and embeddings. 28-37
- Alexander I. Bobenko: Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications. 38
2A
- Kenneth L. Clarkson: Tighter bounds for random projections of manifolds. 39-48
- Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. 59-68
2B
- Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir: The complexity of the outer face in arrangements of random segments. 69-78
- Timothy M. Chan: On levels in arrangements of curves, iii: further improvements. 85-93
3
- Timothy M. Chan: A (slightly) faster algorithm for klee's measure problem. 94-100
- Erin W. Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite: Walking your dog in the woods in polynomial time. 101-109
- Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers: Hinged dissections exist. 110-119
- Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc: Helly-type theorems for approximate covering. 120-128
4
- Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri: I/o-efficient efficient algorithms for computing contours on a terrain. 129-138
- Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao: External memory planar point location with logarithmic updates. 139-147
5A
- Eric Berberich, Michael Kerber, Michael Sagraloff: Exact geometric-topological analysis of algebraic surfaces. 164-173
- Olivier Devillers, Marc Glisse, Sylvain Lazard: Predicates for line transversals to lines and line segments in three-dimensional space. 174-181
- Frédéric Cazals, Aditya G. Parameswaran, Sylvain Pion: Robust construction of the three-dimensional flow complex. 182-191
5B
- Hans Raj Tiwary, Khaled M. Elbassioni: On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. 192-198
- Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. 208-217
Video and multimedia presentations
- Pavel Emeliyanenko, Michael Kerber: Visualizing and exploring planar algebraic arrangements: a web application. 224-225
- Jyh-Ming Lien: Minkowski sums of rotating convex polyhedra. 228-229
- Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Arto Vihavainen: Routing a maximum number of disks through a scene of moving obstacles. 230-231
7
- Erin W. Chambers, Jeff Erickson, Pratik Worah: Testing contractibility in planar rips complexes. 251-259
- Eitan Yaffe, Dan Halperin: Approximating the pathway axis and the persistence diagram of a collection of balls in 3-space. 260-269
8
- Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec: Locally uniform anisotropic meshing. 270-277
- Pankaj K. Agarwal, Bardia Sadri, Hai Yu: Untangling triangulations through local explorations. 288-297
- Maarten Löffler, Jack Snoeyink: Delaunay triangulations of imprecise pointsin linear time after preprocessing. 298-304
- Kenneth L. Clarkson: Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. 305
9A
- Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson: A simple and efficient kinetic spanner. 306-310
- Luca Castelli Aleardi, Éric Fusy, Thomas Lewiner: Schnyder woods for higher genus triangulated surfaces. 311-319
- Minkyoung Cho, David M. Mount: Embedding and similarity search for point sets under translation. 320-327
9B
- Naoki Katoh, Shin-ichi Tanigawa: Fast enumeration algorithms for non-crossing geometric graphs. 328-337
- Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein: Polychromatic colorings of plane graphs. 338-345
- Jacob Fox, János Pach: Coloring kk-free intersection graphs of geometric objects in the plane. 346-354
10
- Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood: Improved upper bounds on the crossing number. 375-384
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team