Computational Geometry, Volume 13

Volume 13, Number 1, May 1999

Jarek Rossignac: Editorial. 1 BibTeX
Victor Milenkovic: Rotational polygon containment and minimum enclosure using only robust 2D constructions. 3-19 BibTeX
Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Point labeling with sliding labels. 21-47 BibTeX
James D. Fix, Richard E. Ladner: Multiresolution banded refinement to accelerate surface reconstruction from polygons. 49-64 BibTeX
Lutz Kettner: Using generic programming for designing a data structure for polyhedral surfaces. 65-90 BibTeX

Sunil Arya, David M. Mount, Michiel H. M. Smid: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. 91-107 BibTeX
Amitava Datta, Christian Icking: Competitive searching in a generalized street. 109-120 BibTeX
Bernd Gärtner: Exact arithmetic at low cost - A case study in linear programming. 121-139 BibTeX
Olivier Devillers, Franco P. Preparata: Further results on arithmetic filters for geometric predicates. 141-148 BibTeX

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec: Convex tours of bounded curvature. 149-159 BibTeX
Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince: On representations of some thickness-two graphs. 161-171 BibTeX
Masatsugu Urabe: Partitioning point sets in space into disjoint convex polytopes. 173-178 BibTeX
Ferran Hurtado, Marc Noy: Graph of triangulations of a convex polygon and tree of triangulations. 179-188 BibTeX
Timothy M. Chan: More planar two-center algorithms. 189-198 BibTeX

John D. Hobby: Practical segment intersection with finite precision output. 199-214 BibTeX
Dorit Dor, Uri Zwick: SOKOBAN and other motion planning problems. 215-228 BibTeX
Jayanth Majhi, Prosenjit Gupta, Ravi Janardan: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. 229-252 BibTeX
Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. 253-261 BibTeX