default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 13
Volume 13, Number 1, May 1999
- Jarek Rossignac:
Editorial. 1 - Victor Milenkovic:
Rotational polygon containment and minimum enclosure using only robust 2D constructions. 3-19 - Marc J. van Kreveld, Tycho Strijk, Alexander Wolff:
Point labeling with sliding labels. 21-47 - James D. Fix, Richard E. Ladner
:
Multiresolution banded refinement to accelerate surface reconstruction from polygons. 49-64 - Lutz Kettner:
Using generic programming for designing a data structure for polyhedral surfaces. 65-90
Volume 13, Number 2, June 1999
- Sunil Arya, David M. Mount, Michiel H. M. Smid:
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. 91-107 - Amitava Datta, Christian Icking:
Competitive searching in a generalized street. 109-120 - Bernd Gärtner:
Exact arithmetic at low cost - A case study in linear programming. 121-139 - Olivier Devillers, Franco P. Preparata:
Further results on arithmetic filters for geometric predicates. 141-148
Volume 13, Number 3, September 1999
- Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex tours of bounded curvature. 149-159 - Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince:
On representations of some thickness-two graphs. 161-171 - Masatsugu Urabe:
Partitioning point sets in space into disjoint convex polytopes. 173-178 - Ferran Hurtado, Marc Noy:
Graph of triangulations of a convex polygon and tree of triangulations. 179-188 - Timothy M. Chan:
More planar two-center algorithms. 189-198
Volume 13, Number 4, October 1999
- John D. Hobby:
Practical segment intersection with finite precision output. 199-214 - Dorit Dor, Uri Zwick:
SOKOBAN and other motion planning problems. 215-228 - Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. 229-252 - Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. 253-261
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-10-22 02:15 CEST 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:
