- 2000
- Pankaj K. Agarwal, Sariel Har-Peled
, Meetesh Karia:
Computing approximate shortest paths on convex polytopes. SCG 2000: 270-279 - Hee-Kap Ahn, Otfried Cheong
, Jirí Matousek, Antoine Vigneron:
Reachability by paths of bounded curvature in convex polygons. SCG 2000: 251-259 - Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos:
Linear-time triangulation of a simple polygon made easier via randomization. SCG 2000: 201-212 - Nina Amenta, Sunghee Choi, Tamal K. Dey, Naveen Leekha:
A simple algorithm for homeomorphic surface reconstruction. SCG 2000: 213-222 - Nina Amenta, Ravi Krishna Kolluri:
Accurate and efficient unions of balls. SCG 2000: 119-128 - Lars Arge, Jan Vahrenhold:
I/O-efficient dynamic planar point location (extended abstract). SCG 2000: 191-200 - Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger:
A Helly-type theorem for hyperplane transversals to well-separated convex sets. SCG 2000: 57-63 - Marshall W. Bern, David Eppstein:
Multivariate regression depth. SCG 2000: 315-321 - Jean-Daniel Boissonnat, Frédéric Cazals
:
Smooth surface reconstruction via natural neighbour interpolation of distance functions. SCG 2000: 223-232 - Jean-Daniel Boissonnat, Olivier Devillers
, Monique Teillaud, Mariette Yvinec:
Triangulations in CGAL (extended abstract). SCG 2000: 11-18 - Peter Braß, Christian Knauer:
Testing the congruence of d-dimensional point sets. SCG 2000: 310-314 - Timothy M. Chan:
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. SCG 2000: 300-309 - Bernard Chazelle, Alexey Lvov:
A trace bound for the hereditary discrepancy. SCG 2000: 64-69 - Olivier Devillers
, Alexandra Fronville, Bernard Mourrain, Monique Teillaud:
Algebraic methods and arithmetic filtering for exact predicates on circle arcs. SCG 2000: 139-147 - Tamal K. Dey, Rephael Wenger:
Reconstruction curves with sharp corners. SCG 2000: 233-241 - Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
Point set labeling with specified positions. SCG 2000: 182-190 - Ioannis Z. Emiris:
Computing integer points in Minkowski sums. SCG 2000: 29-36 - Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht:
On the continuous Weber and k-median problems (extended abstract). SCG 2000: 70-79 - Rudolf Fleischer, Gerhard Trippen:
Optimal robot localization in trees. SCG 2000: 373-374 - Stefan Funke, Kurt Mehlhorn:
Look - a Lazy Object-Oriented Kernel for geometric computation. SCG 2000: 156-165 - Bernd Gärtner:
Pitfalls in computing with pseudorandom determinants. SCG 2000: 148-155 - Bernd Gärtner, Sven Schönherr:
An efficient, exact, and generic quadratic programming solver for geometric optimization. SCG 2000: 110-118 - Bernd Gärtner, Emo Welzl:
Random sampling in geometric optimization: new insights and applications. SCG 2000: 91-99 - Leonidas J. Guibas, John Hershberger, Subhash Suri, Li Zhang:
Kinetic connectivity for unit disks. SCG 2000: 331-340 - Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-center problem with obstacles. SCG 2000: 80-90 - Sariel Har-Peled
, Piotr Indyk:
When crossings count - approximating the minimum spanning tree. SCG 2000: 166-175 - Hisamoto Hiyoshi, Kokichi Sugihara:
Voronoi-based interpolation with higher continuity. SCG 2000: 242-250 - Kenneth E. Hoff III, Tim Culver, John Keyser
, Ming C. Lin, Dinesh Manocha:
Fast computation of generalized Voronoi diagrams using graphics hardware. SCG 2000: 375-376 - Martin Isenburg, Jack Snoeyink:
The face fixer video. SCG 2000: 377-378 - 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. SCG 2000: 100-109