Fast exact and approximate geodesics on meshes
暂无分享,去创建一个
Steven J. Gortler | Hugues Hoppe | Vitaly Surazhsky | Tatiana Surazhsky | Danil Kirsanov | S. Gortler | Hugues Hoppe | D. Kirsanov | Vitaly Surazhsky | Tatiana Surazhsky | V. Surazhsky
[1] Luc Biard,et al. Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes , 2004, Numerical Algorithms.
[2] Marcin Novotni,et al. Gomputing geodesic distances on triangular meshes , 2002 .
[3] Pedro V. Sander,et al. Multi-Chart Geometry Images , 2003, Symposium on Geometry Processing.
[4] Kun Zhou,et al. Iso-charts: stretch-driven mesh parameterization using spectral analysis , 2004, SGP '04.
[5] Joseph S. B. Mitchell,et al. Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.
[6] Luiz Velho,et al. Geodesic paths on triangular meshes , 2004, Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing.
[7] Konrad Polthier,et al. Straightest geodesics on polyhedral surfaces , 2006, SIGGRAPH Courses.
[8] Taku Komura,et al. Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.
[9] Mark Meyer,et al. Meshes on fire , 2001 .
[10] Marc Levoy,et al. Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.
[11] Charles T. Loop,et al. Smooth Subdivision Surfaces Based on Triangles , 1987 .
[12] Hans-Peter Seidel,et al. Interactive multi-resolution modeling on arbitrary meshes , 1998, SIGGRAPH.
[13] J A Sethian,et al. Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.
[14] Andrew V. Goldberg,et al. Computing the shortest path: A search meets graph theory , 2005, SODA '05.
[15] Joseph O'Rourke,et al. An Implementation of Chen & Han's Shortest Paths Algorithm , 2000, Canadian Conference on Computational Geometry.
[16] Hiromasa Suzuki,et al. Approximate shortest path on a polyhedral surface and its applications , 2001, Comput. Aided Des..
[17] C. Chui,et al. Parameterization of Manifold Triangulations , 2002 .
[18] Alla Sheffer,et al. Geodesic-based Surface Remeshing , 2003, IMR.
[19] Subhash Suri,et al. An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..
[20] Adam Finkelstein,et al. Lapped textures , 2000, SIGGRAPH.
[21] Ron Kimmel,et al. Texture Mapping Using Surface Flattening via Multidimensional Scaling , 2002, IEEE Trans. Vis. Comput. Graph..
[22] Sanjiv Kapoor,et al. Efficient computation of geodesic shortest paths , 1999, STOC '99.
[23] Steven J. Gortler,et al. Minimal discrete curves and surfaces , 2004 .
[24] Adam Finkelstein,et al. Robust mesh watermarking , 1999, SIGGRAPH.
[25] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[26] Szymon Rusinkiewicz,et al. Modeling by example , 2004, ACM Trans. Graph..
[27] Jörg-Rüdiger Sack,et al. Approximating weighted shortest paths on polyhedral surfaces , 1997, SCG '97.
[28] Ayellet Tal,et al. Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..
[29] Laurent D. Cohen,et al. Geodesic Computations for Fast and Accurate Surface Remeshing and Parameterization , 2005 .
[30] Michael S. Floater,et al. Chordal cubic spline interpolation is fourth-order accurate , 2006 .
[31] Peter-Pike J. Sloan,et al. Shape by example , 2001, I3D '01.