default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th SCG 2004: Brooklyn, New York, USA
- Jack Snoeyink, Jean-Daniel Boissonnat:
Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004. ACM 2004, ISBN 1-58113-885-7
Session 1
- Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
:
Geodesic ham-sandwich cuts. 1-9 - Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. 10-16 - Jyh-Ming Lien, Nancy M. Amato:
Approximate convex decomposition of polygons. 17-26 - Boaz Ben-Moshe, Olaf A. Hall-Holt, Matthew J. Katz, Joseph S. B. Mitchell:
Computing the visibility graph of points within a polygon. 27-35
Session 2
- Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir:
On lines avoiding unit balls in three dimensions. 36-45 - Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. 46-55 - Günter M. Ziegler:
Random monotone paths on polyhedra. 56
Session 3
- Adrian Dumitrescu:
On distinct distances from a vertex of a convex polygon. 57-60 - Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. 61-67 - János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth:
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. 68-75 - János Pach, Rom Pinchasi, Micha Sharir:
Solution of Scott's problem on the number of directions determined by a point set in 3-space. 76-85
Session 4
- Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin:
Continuous path verification in multi-axis NC-machining. 86-95 - Stefan Funke, Theocharis Malamatos, Rahul Ray:
Finding planar regions in a terrain: in practice and with a guarantree. 96-105 - Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark:
A scalable simulator for forest dynamics. 106-115
Session 5a
- Adrian Dumitrescu, János Pach:
Pushing squares around. 116-123 - Joseph S. B. Mitchell, Micha Sharir:
New results on shortest paths in three dimensions. 124-133 - Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, James F. O'Brien:
An energy-driven approach to linkage unfolding. 134-143
Session 5b
- Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams. 144-151 - Timothy M. Chan:
Faster core-set constructions and data stream algorithms in fixed dimensions. 152-159 - Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range counting over multidimensional data streams. 160-169
Session 6a
- Leonidas J. Guibas, Daniel Russel:
An empirical comparison of techniques for updating Delaunay triangulations. 170-179 - Pankaj K. Agarwal, Yusu Wang, Hai Yu:
A 2D kinetic triangulation with near-quadratic topological changes. 180-189 - Jie Gao, Leonidas J. Guibas, An Thanh Nguyen:
Deformable spanners and applications. 190-199 - David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
A computational framework for incremental motion. 200-209
Session 6b
- Esther Ezra, Micha Sharir:
Counting and representing intersections among triangles in three dimensions. 210-219 - Ilya Baran, Erik D. Demaine:
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. 220-229 - John Hershberger, Subhash Suri, Csaba D. Tóth:
Binary space partitions of orthogonal subdivisions. 230-238 - Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen:
Towards in-place geometric algorithms and data structures. 239-246
Session 7
- Pankaj K. Agarwal, Kasturi R. Varadarajan:
A near-linear constant-factor approximation for euclidean bipartite matching? 247-252 - Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni:
Locality-sensitive hashing scheme based on p-stable distributions. 253-262 - Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan:
Practical methods for shape fitting and kinetic data structures using core sets. 263-272 - Jeff Erickson, Sariel Har-Peled, David M. Mount:
On the least median square problem. 273-279
Session 8
- Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray:
Sampling and meshing a surface with guaranteed topology and geometry. 280-289 - Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray:
Quality meshing for polyhedra with small angles. 290-299 - Reza Abedi, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert B. Haber, John M. Sullivan, Shripad Thite, Yuan Zhou:
Spacetime meshing with adaptive refinement and coarsening. 300-309 - David E. Cardoze, Alexandre Cunha, Gary L. Miller, Todd Phillips, Noel Walkington:
A Bézier-based approach to unstructured moving meshes. 310-319
Session 9
- Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-dimensional embedding with extra information. 320-329 - Tamal K. Dey, Samrat Goswami:
Provable surface reconstruction from noisy samples. 330-339 - Christian A. Duncan, David Eppstein, Stephen G. Kobourov:
The geometric thickness of low degree graphs. 340-346
Session 10
- Afra Zomorodian, Gunnar E. Carlsson:
Computing persistent homology. 347-356 - Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang:
Extreme elevation on a 2-manifold. 357-365 - Herbert Edelsbrunner, John Harer, Ajith Mascarenhas, Valerio Pascucci:
Time-varying reeb graphs for continuous space-time data. 366-372 - Uri Laserson, Hin Hark Gan, Tamar Schlick:
Searching for 2D RNA geometries in bacterial genomes. 373-377
Session 11
- Rom Pinchasi, Shakhar Smorodinsky:
On locally Delaunay geometric graphs. 378-382 - Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir:
On the union of kapa-round objects. 383-390 - Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. 391-400 - Bohdan Kaluzny, Komei Fukuda:
The criss-cross method can take Omega(nd) pivots. 401-408
Session 12
- Arno Eigenwillig, Lutz Kettner, Elmar Schömer, Nicola Wolpert:
Complete, exact, and efficient computations with cubic curves. 409-418 - Sylvain Lazard, Luis Mariano Peñaranda, Sylvain Petitjean:
Intersecting quadrics: an efficient and exact implementation. 419-428 - Olivier Devillers, Philippe Guigue:
Inner and outer rounding of set operations on lattice polygonal regions. 429-437 - Ioannis Z. Emiris, Athanasios Kakargias, Sylvain Pion, Monique Teillaud, Elias P. Tsigaridas:
Towards and open curved kernel. 438-446
Video and multimedia session
- Russel A. Apu, Marina L. Gavrilova:
Adaptive mesh generation for real-time terrain modeling. 447-448 - Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an autonomous robot. 449-450 - Cesim Erten, Stephen G. Kobourov, Chandan Pitta:
Morphing planar graphs. 451-452 - Olaf A. Hall-Holt:
The corner arc algorithm. 453-454 - David Eppstein, M. Gopi:
Single-strip triangulation of manifolds with arbitrary topology. 455-456 - Jyh-Ming Lien, Nancy M. Amato:
Approximate convex decomposition. 457-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-04 22: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:
