Improving Chen and Han's algorithm on the discrete geodesic problem

@article{Xin2009ImprovingCA,
  title={Improving Chen and Han's algorithm on the discrete geodesic problem},
  author={Shiqing Xin and Guo-Jin Wang},
  journal={ACM Trans. Graph.},
  year={2009},
  volume={28},
  pages={104:1-104:8}
}
The computation of geodesic distances or paths between two points on triangulated meshes is a common operation in many computer graphics applications. In this article, we present an exact algorithm for the single-source all-vertices shortest path problem. Mitchell et al. [1987] proposed an O(n2 log n) method (MMP), based on Dijkstra's algorithm, where n is the complexity of the polyhedral surface. Then, Chen and Han [1990] (CH) improved the running time to O(n2). Interestingly Surazhsky et al… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 70 CITATIONS

Efficient and practical algorithms for discrete geodesics

VIEW 18 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

An optimization-driven approach for computing geodesic paths on triangle meshes

  • Computer-Aided Design
  • 2017
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND

An Intrinsic Algorithm for Parallel Poisson Disk Sampling on Arbitrary Surfaces

  • IEEE Transactions on Visualization and Computer Graphics
  • 2013
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS

Fast Wavefront Propagation (FWP) for Computing Exact Geodesic Distances on Meshes

  • IEEE Transactions on Visualization and Computer Graphics
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Intrinsic computation of voronoi diagrams on surfaces and its application

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A parallel algorithm for improving the maximal property of Poisson disk sampling

  • Computer-Aided Design
  • 2014
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Novel interfaces for modeling and painting

VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2010
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Fast Marching Methods

  • SIAM Review
  • 1999
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On Shortest Paths in Polyhedral Spaces

  • SIAM J. Comput.
  • 1986
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A note on two problems in connection with graphs

E. DIJKSTRA
  • Numerische Mathematik 1, 269–271.
  • 1959
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL