Volume 12,
Number 1-2,
February 1999
- David Eppstein:
Linear complexity hexahedral mesh generation.
3-16
- Sandy Irani, Prabhakar Raghavan:
Combinatorial and experimental results for randomized point matching algorithms.
17-31
- Simon Kahan, Jack Snoeyink:
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time.
33-44
- Gill Barequet, Micha Sharir:
Partial surface matching by using directed footprints.
45-62
- Ernst P. Mücke, Isaac Saias, Binhai Zhu:
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.
63-83
- Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig:
Checking geometric programs or verification of geometric structures.
85-103
- Satyan R. Coorg, Seth J. Teller:
Temporally coherent conservative visibility.
105-124
- James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia:
Visualizing geometric algorithms over the Web.
125-152
Volume 12,
Number 3-4,
April 1999
Copyright © Mon Nov 2 21:28:41 2009
by Michael Ley (ley@uni-trier.de)
