Approximate shortest path on a polyhedral surface and its applications
Authors:
- Takashi KanaiTKTakashi Kanai
- Hiromasa SuzukiHSHiromasa Suzuki
- 1 September 2001
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 33 (11) , 801-811
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Approximating shortest paths on a nonconvex polyhedron2002
- Surface simplification using quadric error metrics1997
- Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions1997
- Approximating weighted shortest paths on polyhedral surfaces1997
- A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)1997
- A volumetric method for building complex models from range images1996
- Shortest paths on a polyhedron1990
- Optimal shortest path queries in a simple polygonJournal of Computer and System Sciences, 1989
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986