Volume 5,
Numer 1-2,
1995
- Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata:
Motion planning of legged robots: the spider robot problem.
3-20
- Michael B. Dillencourt, Warren D. Smith:
A linear-time algorithm for testing the inscribability of trivalent polyhedra.
21-36
- Naoki Katoh, Kazuo Iwano:
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane.
37-51
- Rolf Klein, Andrzej Lingas:
Manhattonian proximity in a simple polygon.
53-74
- Helmut Alt, Michael Godau:
Computing the Fréchet distance between two polygonal curves.
75-91
- Danny Z. Chen:
An optimal parallel algorithm for detecting weak visibility of a simple polygon.
93-124
- Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
New sparseness results on graph spanners.
125-144
- John Hershberger:
Optimal parallel algorithms for triangulated simple polygons.
145-170
- Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating polygons without large angles.
171-192
- Steven Fortune:
Numerical stability of algorithms for 2-d Delaunay triangulations.
193-213
- Joseph O'Rourke:
Computational geometry column 25.
215-218
Volume 5,
Number 3,
1995
Volume 5,
Number 4,
1995
Copyright © Sun Dec 20 01:18:50 2009
by Michael Ley (ley@uni-trier.de)
