On shortest paths in polyhedral spaces
SIAM Journal on Computing
SIAM Journal on Computing
3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Finding All Shortest Path Edge Sequences on a Convex Polyhedron
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
New lower bound techniques for robot motion planning problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Shortest path queries in rectilinear worlds of higher dimension (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Nonoverlap of the star unfolding
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Fitting smooth surfaces to dense polygon meshes
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Approximating shortest paths on a convex polytope in three dimensions
Proceedings of the twelfth annual symposium on Computational geometry
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
Approximating shortest paths on a convex polytope in three dimensions
Journal of the ACM (JACM)
Practical methods for approximating shortest paths on a convex polytope in R3
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Metamorphosis of Arbitrary Triangular Meshes
IEEE Computer Graphics and Applications
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SwingWrapper: Retiling triangle meshes for better edgebreaker compression
ACM Transactions on Graphics (TOG)
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Theoretical Computer Science - Algebraic and numerical algorithm
Geodesic Remeshing Using Front Propagation
International Journal of Computer Vision
A spectral approach to shape-based retrieval of articulated 3D models
Computer-Aided Design
Efficiently determining a locally exact shortest path on polyhedral surfaces
Computer-Aided Design
A multi-resolution surface distance model for k-NN query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment
Improving Chen and Han's algorithm on the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Point cloud surfaces using geometric proximity graphs
Computers and Graphics
Computing geodesics on triangular meshes
Computers and Graphics
Reducing the memory required to find a geodesic shortest path on a large mesh
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Continuous monitoring of nearest neighbors on land surface
Proceedings of the VLDB Endowment
Scalable shortest paths browsing on land surface
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Finding shortest path on land surface
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Approximate shortest path queries on weighted polyhedral surfaces
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
Short-Cuts on star, source and planar unfoldings
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Constant-time all-pairs geodesic distance query on triangle meshes
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Couple points --- a local approach to global surface analysis
Proceedings of the 7th international conference on Curves and Surfaces
Proximity graphs for defining surfaces over point clouds
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
Proceedings of the 21st ACM international conference on Information and knowledge management
A global algorithm to compute defect-tolerant geodesic distance
SIGGRAPH Asia 2012 Technical Briefs
Saddle vertex graph (SVG): a novel solution to the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Parallel chen-han (PCH) algorithm for discrete geodesics
ACM Transactions on Graphics (TOG)
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a polyhedron (need not be convex). Our algorithm uses a new approach which deviates from the conventional “continuous Dijkstra” technique. It takes &Ogr;(n2) time and ⊖(n) space to determine the shortest path and to compute the inward layout which can be used to construct a structure for processing queries of shortest path from the source point to any destination point.