Approximate shortest path on a polyhedral surface and its applications
- 14 September 2001
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 33 (11), 801-811
- https://doi.org/10.1016/s0010-4485(01)00097-5
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Approximating shortest paths on a nonconvex polyhedronPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Surface simplification using quadric error metricsPublished by Association for Computing Machinery (ACM) ,1997
- Approximate shortest paths and geodesic diameters on convex polytopes in three dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Approximating weighted shortest paths on polyhedral surfacesPublished by Association for Computing Machinery (ACM) ,1997
- A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- A volumetric method for building complex models from range imagesPublished by Association for Computing Machinery (ACM) ,1996
- Shortest paths on a polyhedronPublished by Association for Computing Machinery (ACM) ,1990
- 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