Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
暂无分享,去创建一个
Shi-Qing Xin | Ying He | Zheng Fang | Xiaoning Wang | Jiajun Wu | Ying He | Jia-Jhe Wu | Shiqing Xin | Zheng Fang | Xiaoning Wang
[1] Ross T. Whitaker,et al. A Fast Iterative Method for Solving the Eikonal Equation on Triangulated Surfaces , 2011, SIAM J. Sci. Comput..
[2] S. Varadhan. On the behavior of the fundamental solution of the heat equation with variable coefficients , 2010 .
[3] Micha Sharir,et al. Approximating shortest paths on a convex polytope in three dimensions , 1996, SCG '96.
[4] J. Sethian,et al. Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. , 2000, Proceedings of the National Academy of Sciences of the United States of America.
[5] Pankaj K. Agarwal,et al. Approximating shortest paths on a nonconvex polyhedron , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[6] Keenan Crane,et al. Geodesics in heat: A new approach to computing distance based on heat flow , 2012, TOGS.
[7] Zhao,et al. PARALLEL IMPLEMENTATIONS OF THE FAST SWEEPING METHOD , 2007 .
[8] Ligang Liu,et al. Fast Wavefront Propagation (FWP) for Computing Exact Geodesic Distances on Meshes , 2015, IEEE Transactions on Visualization and Computer Graphics.
[9] Ying He,et al. Saddle vertex graph (SVG) , 2013, ACM Trans. Graph..
[10] Alexander M. Bronstein,et al. Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.
[11] Alexander G. Belyaev,et al. On Variational and PDE‐Based Distance Function Approximations , 2015, Comput. Graph. Forum.
[12] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[13] Frédéric Gibou,et al. A parallel fast sweeping method for the Eikonal equation , 2013, J. Comput. Phys..
[14] Sariel Har-Peled,et al. Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions , 1997, SCG '97.
[15] Marcel Campen,et al. Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations , 2011, Comput. Graph. Forum.
[16] Leonidas J. Guibas,et al. Earth mover's distances on discrete surfaces , 2014, ACM Trans. Graph..
[17] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[18] Jörg-Rüdiger Sack,et al. An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces , 1998, SWAT.
[19] J A Sethian,et al. A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[20] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.
[21] Yevgeny Schreiber. An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra , 2010, Discret. Comput. Geom..
[22] David Bommes,et al. Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes , 2007, VMV.
[23] Jian-Jun Zhang,et al. Fast and exact discrete geodesic computation based on triangle-oriented wavefront propagation , 2016, ACM Trans. Graph..
[24] Thomas A. Funkhouser,et al. Biharmonic distance , 2010, TOGS.
[25] J A Sethian,et al. Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.
[26] Micha Sharir,et al. An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions , 2008, Discret. Comput. Geom..
[27] Yizhou Yu,et al. Title Fast and Exact Discrete Geodesic Computation Based onTriangle-Oriented Wavefront Propagation , 2016 .
[28] Subhash Suri,et al. Practical methods for approximating shortest paths on a convex polytope in R3 , 1998, SODA '95.
[29] Marcel Campen,et al. Practical Anisotropic Geodesy , 2013, SGP '13.
[30] F. Mémoli,et al. Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces: 730 , 2001 .
[31] S. Suri,et al. Practical methods for approximating shortest paths on a convex polytope in R 3 , 1995, SODA 1995.
[32] Shi-Qing Xin,et al. Parallel chen-han (PCH) algorithm for discrete geodesics , 2013, ACM Trans. Graph..
[33] Shi-Qing Xin,et al. Efficiently computing geodesic offsets on triangle meshes by the extended Xin-Wang algorithm , 2011, Comput. Aided Des..
[34] Shi-Qing Xin,et al. Constant-time O(1) all pairs geodesic distance query on triangle meshes , 2011, SA '11.
[35] R. Kimmel,et al. An efficient solution to the eikonal equation on parametric manifolds , 2004 .
[36] Shi-Min Hu,et al. Handling degenerate cases in exact geodesic computation on triangle meshes , 2007, The Visual Computer.
[37] Shi-Qing Xin,et al. Improving Chen and Han's algorithm on the discrete geodesic problem , 2009, TOGS.
[38] Steven J. Gortler,et al. Fast exact and approximate geodesics on meshes , 2005, ACM Trans. Graph..
[39] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[40] Yong-Jin Liu,et al. Efficient construction and simplification of Delaunay meshes , 2015, ACM Trans. Graph..
[41] Ying He,et al. A global algorithm to compute defect-tolerant geodesic distance , 2012, SIGGRAPH Asia Technical Briefs.
[42] Yong-Jin Liu,et al. Exact geodesic metric in 2-manifold triangle meshes using edge-based data structures , 2013, Comput. Aided Des..
[43] J. Tsitsiklis,et al. Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.
[44] Sariel Har-Peled,et al. Constructing approximate shortest path maps in three dimensions , 1998, SCG '98.