Approximating weighted shortest paths on polyhedral surfaces

Authors:
Mark Lanthier;Anil Maheshwari;Jörg-Rüdiger Sack
Affiliations:
School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6
Venue:
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Year:
1997

Citing 11
Cited 29

On shortest paths in polyhedral spaces

SIAM Journal on Computing
Approximation algorithms for shortest path motion planning

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The discrete geodesic problem

SIAM Journal on Computing
Optimal shortest path queries in a simple polygon

SCG '87 Proceedings of the third annual symposium on Computational geometry
Shortest paths on a polyhedron

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Approximating shortest paths on a convex polytope in three dimensions

Proceedings of the twelfth annual symposium on Computational geometry
Parallel neighbourhood modelling

GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Approximating weighted shortest paths on polyhedral surfaces

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Star Unfolding of a Polytope with Applications

SIAM Journal on Computing
Practical methods for approximating shortest paths on a convex polytope in R3

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Approximating weighted shortest paths on polyhedral surfaces

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximating weighted shortest paths on polyhedral surfaces

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Constructing approximate shortest path maps in three dimensions

Proceedings of the fourteenth annual symposium on Computational geometry
Determining an optimal penetration among weighted regions in two and three dimensions

SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Approximation algorithms for geometric shortest path problems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computing approximate shortest paths on convex polytopes

Proceedings of the sixteenth annual symposium on Computational geometry
Simplification of surface annotations

Proceedings of the conference on Visualization '00
Topology matching for fully automatic similarity estimation of 3D shapes

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
VARIANT: A System for Terrain Modeling at Variable Resolution

Geoinformatica
Metamorphosis of Arbitrary Triangular Meshes

IEEE Computer Graphics and Applications
An external memory data structure for shortest path queries

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Improved Optimal Weighted Links Algorithms

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Parallel Optimal Weighted Links

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Movement Planning in the Presence of Flows

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Shortest Anisotropic Paths on Terrains

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Fast exact and approximate geodesics on meshes

ACM SIGGRAPH 2005 Papers
On finding approximate optimal paths in weighted regions

Journal of Algorithms
Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves

Journal of Mathematical Imaging and Vision
Approximate shortest paths in anisotropic regions

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On finding approximate optimal paths in weighted regions

Journal of Algorithms
Applying the improved Chen and Han's algorithm to different versions of shortest path problems on a polyhedral surface

Computer-Aided Design
Finding shortest path on land surface

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey of geodesic paths on 3D surfaces

Computational Geometry: Theory and Applications
Reconstructing multiresolution mesh for web visualization based on PDE resampling

Transactions on computational science XII
Quickest paths in anisotropic media

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A framework for working with digitized cultural heritage artifacts

ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Expansion-Based algorithms for finding single pair shortest path on surface

W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Practical anisotropic geodesy

SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing

Quantified Score

Hi-index	0.00

Approximating weighted shortest paths on polyhedral surfaces

Quantified Score

Visualization

Abstract