- David G. Kirkpatrick, Jack Snoeyink, Bettina Speckmann:
Kinetic collision detection for simple polygons. SCG 2000: 322-330 - Steven M. LaValle, Borislav H. Simov, Giora Slutzki:
An algorithm for searching a polygonal region with a flashlight. SCG 2000: 260-269 - Greg Leibon, David Letscher:
Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. SCG 2000: 341-349 - Jesús A. De Loera, Frederick J. Wicklin:
Viro's method disproves Ragsdale's conjecture: a story. SCG 2000: 371-372 - Victor Milenkovic:
Densest tanslational lattice packing of non-convex polygons (extended abstract). SCG 2000: 280-289 - Matthias Müller-Hannemann
:
Improving the surface cycle structure for hexahedral mesh generation. SCG 2000: 19-28 - János Pach, Gábor Tardos:
Cutting glass. SCG 2000: 360-369 - Edgar A. Ramos:
Linear programming queries revisited. SCG 2000: 176-181 - Edgar A. Ramos:
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes. SCG 2000: 290-299 - Micha Sharir, Shakhar Smorodinsky
, Gábor Tardos:
An improved bound for k-sets in three dimensions. SCG 2000: 43-49 - Jonathan Richard Shewchuk:
Mesh generation for domains with small angles. SCG 2000: 1-10 - Jonathan Richard Shewchuk:
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. SCG 2000: 350-359 - Géza Tóth:
Point sets with many k-sets. SCG 2000: 37-42 - Uli Wagner
, Emo Welzl:
Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG 2000: 50-56 - Afra Zomorodian, Herbert Edelsbrunner:
Fast software for box intersections. SCG 2000: 129-138 - 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 [contents]