default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SCG 2000: Clear Water Bay, Hong Kong, China
- Siu-Wing Cheng, Otfried Cheong, Pankaj K. Agarwal, Steven Fortune:
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000. ACM 2000, ISBN 1-58113-224-7 - Jonathan Richard Shewchuk:
Mesh generation for domains with small angles. 1-10 - Jean-Daniel Boissonnat, Olivier Devillers
, Monique Teillaud, Mariette Yvinec:
Triangulations in CGAL (extended abstract). 11-18 - Matthias Müller-Hannemann:
Improving the surface cycle structure for hexahedral mesh generation. 19-28 - Ioannis Z. Emiris:
Computing integer points in Minkowski sums. 29-36 - Géza Tóth:
Point sets with many k-sets. 37-42 - Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An improved bound for k-sets in three dimensions. 43-49 - Uli Wagner, Emo Welzl:
Origin-embracing distributions or a continuous analogue of the upper bound theorem. 50-56 - Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets. 57-63 - Bernard Chazelle, Alexey Lvov:
A trace bound for the hereditary discrepancy. 64-69 - Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht:
On the continuous Weber and k-median problems (extended abstract). 70-79 - Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-center problem with obstacles. 80-90 - Bernd Gärtner, Emo Welzl:
Random sampling in geometric optimization: new insights and applications. 91-99 - Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
The analysis of a simple k-means clustering algorithm. 100-109 - Bernd Gärtner, Sven Schönherr:
An efficient, exact, and generic quadratic programming solver for geometric optimization. 110-118 - Nina Amenta, Ravi Krishna Kolluri:
Accurate and efficient unions of balls. 119-128 - Afra Zomorodian, Herbert Edelsbrunner:
Fast software for box intersections. 129-138 - Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud:
Algebraic methods and arithmetic filtering for exact predicates on circle arcs. 139-147 - Bernd Gärtner:
Pitfalls in computing with pseudorandom determinants. 148-155 - Stefan Funke, Kurt Mehlhorn:
Look - a Lazy Object-Oriented Kernel for geometric computation. 156-165 - Sariel Har-Peled, Piotr Indyk:
When crossings count - approximating the minimum spanning tree. 166-175 - Edgar A. Ramos:
Linear programming queries revisited. 176-181 - Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
Point set labeling with specified positions. 182-190 - Lars Arge, Jan Vahrenhold:
I/O-efficient dynamic planar point location (extended abstract). 191-200 - Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Linear-time triangulation of a simple polygon made easier via randomization. 201-212 - Nina Amenta, Sunghee Choi, Tamal K. Dey, Naveen Leekha:
A simple algorithm for homeomorphic surface reconstruction. 213-222 - Jean-Daniel Boissonnat, Frédéric Cazals:
Smooth surface reconstruction via natural neighbour interpolation of distance functions. 223-232 - Tamal K. Dey, Rephael Wenger:
Reconstruction curves with sharp corners. 233-241 - Hisamoto Hiyoshi, Kokichi Sugihara:
Voronoi-based interpolation with higher continuity. 242-250 - Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons. 251-259 - Steven M. LaValle, Borislav H. Simov, Giora Slutzki:
An algorithm for searching a polygonal region with a flashlight. 260-269 - Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia:
Computing approximate shortest paths on convex polytopes. 270-279 - Victor Milenkovic:
Densest tanslational lattice packing of non-convex polygons (extended abstract). 280-289 - Edgar A. Ramos:
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. 290-299 - Timothy M. Chan:
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. 300-309 - Peter Braß, Christian Knauer:
Testing the congruence of d-dimensional point sets. 310-314 - Marshall W. Bern, David Eppstein:
Multivariate regression depth. 315-321 - David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
Kinetic collision detection for simple polygons. 322-330 - Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic connectivity for unit disks. 331-340 - Greg Leibon, David Letscher:
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. 341-349 - Jonathan Richard Shewchuk:
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. 350-359 - János Pach, Gábor Tardos:
Cutting glass. 360-369 - Jesús A. De Loera, Frederick J. Wicklin:
Viro's method disproves Ragsdale's conjecture: a story. 371-372 - Rudolf Fleischer, Gerhard Trippen:
Optimal robot localization in trees. 373-374 - Kenneth E. Hoff III, Tim Culver, John Keyser, Ming C. Lin, Dinesh Manocha:
Fast computation of generalized Voronoi diagrams using graphics hardware. 375-376 - Martin Isenburg, Jack Snoeyink:
The face fixer video. 377-378
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-05 22:22 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:
