default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th SCG 2002: Barcelona, Spain
- Ferran Hurtado, Vera Sacristán, Chandrajit Bajaj, Subhash Suri:
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002. ACM 2002, ISBN 1-58113-504-1 - René van Oostrum, Remco C. Veltkamp:
Parametric search made practical. 1-9 - Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko
, Ruth Silverman, Angela Y. Wu:
A local search approximation algorithm for k-means clustering. 10-18 - Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
On the crossing number of complete graphs. 19-24 - Ciprian Borcea, Ileana Streinu:
On the number of embeddings of minimally rigid graphs. 25-32 - Leonidas J. Guibas, An Thanh Nguyen, Daniel Russel, Li Zhang:
Collision detection for deforming necklaces. 33-42 - Itay Lotan, Fabian Schwarzer, Dan Halperin, Jean-Claude Latombe:
Efficient maintenance and self-collision testing for Kinematic Chains. 43-52 - Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. 53-62 - Nathan Linial:
Finite metric spaces: combinatorics, geometry and algorithms. 63 - L. Paul Chew, Klara Kedem:
Finding the consensus shape for a protein family. 64-73 - Marshall W. Bern, David Goldberg:
Paper position sensing. 74-81 - David Goldberg, Christopher Malon, Marshall W. Bern:
A global approach to automatic solution of jigsaw puzzles. 82-87 - Bernard Chazelle:
The power of nonmonotonicity in geometric searching. 88-93 - Ilan Newman, Yuri Rabinovich:
A lower bound on the distortion of embedding planar metrics into Euclidean space. 94-96 - Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek:
The one-round Voronoi game. 97-101 - Piotr Indyk:
Approximate nearest neighbor algorithms for Frechet distance via product metrics. 102-106 - Micha Sharir, Emo Welzl:
Point-line incidences in space. 107-115 - Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between points and circles in three and higher dimensions. 116-122 - Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. 123-132 - Günter Rote:
Pseudotriangulations, polytopes, and how to expand linkages. 133-134 - Démian Nave, Nikos Chrisochoides, L. Paul Chew:
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains. 135-144 - Sunghee Choi:
The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi. 145-150 - Oswin Aichholzer, Franz Aurenhammer, Belén Palop:
Quickest paths, straight skeletons, and the city Voronoi diagram. 151-159 - Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for paths in the plane. 160-169 - Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap:
Pseudo approximation algorithms, with applications to optimal motion planning. 170-178 - David G. Kirkpatrick, Bettina Speckmann:
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. 179-188 - Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink:
Interlocked open linkages with few joints. 189-198 - David Cohen-Steiner, Éric Colin de Verdière, Mariette Yvinec:
Conforming Delaunay triangulations in 3D. 199-208 - Mordecai J. Golin, Hyeon-Suk Na:
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. 209-216 - Vladlen Koltun, Micha Sharir:
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. 217-226 - Vladlen Koltun, Micha Sharir:
Polyhedral Voronoi diagrams of polyhedra in three dimensions. 227-236 - Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. 237-243 - Jeff Erickson, Sariel Har-Peled:
Optimally cutting a surface into a disk. 244-253 - Regina Estkowski, Joseph S. B. Mitchell, Xinyu Xiang:
Optimal decomposition of polygonal models into triangle strips. 254-263 - Igor Guskov, Andrei Khodakovsky, Peter Schröder, Wim Sweldens:
Hybrid meshes: multiresolution using regular and irregular refinement. 264-272 - Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz:
Exact minkowski sums and applications. 273-274 - Daniel Kotzor, Thorsten Theobald:
Homotopy techniques for real-time visualization of geometric tangent problems. 275-276 - Alon Efrat, Stephen G. Kobourov, Michael Stepp, Carola Wenk:
Growing fat graphs. 277-278 - Alexander Bogomjakov, Craig Gotsman:
AUTO-FOLLOW: getting a piece of the action all the time. 279-280 - Stanislav V. Klimenko, Gregory M. Nielson, Lialia Nikitina, Igor N. Nikitin:
Adventures of Möbius band: mathematical visualization in virtual environment. 281-282 - Hayim Shaul, Dan Halperin:
Improved construction of vertical decompositions of three-dimensional arrangements. 283-292 - Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang:
Cost prediction for ray shooting. 293-302 - Boaz Ben-Moshe, Joseph S. B. Mitchell, Matthew J. Katz, Yuval Nir:
Visibility preserving terrain simplification: an experimental study. 303-311 - Sariel Har-Peled, Kasturi R. Varadarajan:
Projective clustering in high dimensions using core-sets. 312-318
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:
