Approximate shortest path on a polyhedral surface and its applications

CAD Computer Aided Design

Volumn 33, Issue 11, 2001, Pages 801-811

  Kanai, Takashi ^a   Suzuki, Hiromasa ^b  

^a KEIO UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Computational geometry; Dijkstra's algorithm; Geometric modeling; Polyhedral surface; Shortest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; SURFACES;

GEOMETRIC MODELING; POLYHEDRAL SURFACES;

COMPUTER AIDED DESIGN;

EID: 0035860117     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(01)00097-5     Document Type: Article

References (21)

1. A volumetric method for building complex models from range images
2. The discrete geodesic problem
3. Shortest paths on a polyhedron
4. Approximating weighted shortest paths on polyhedral surfraces
5. A new algorithm for computing shortest paths in weighted planar subdivisions
6. Geometric shortest paths and network optimization
7. On shortest paths in polyhedral spaces
8. Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions
9. Approximating shortest paths on a nonconvex polyhedron
10. Optimal shortest path queries in a simple polygon
11. Surface simplification using quadric error metrics
12. Interactive texture mapping
13. Fitting smooth surfaces to dense polygon meshes
14. MAPS: Multiresolution adaptive parameterization of surfaces
15. Discrete parameterization for deforming arbitrary meshes
16. Interactive multiresolution editing of arbitrary meshes
17. Metamorphosis of arbitrary triangular meshes
18. Interactive mesh fusion based on local 3D metamorphosis
19. Undirected single source shortest paths in linear time