A global algorithm to compute defect-tolerant geodesic distance
Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various t...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/97269 http://hdl.handle.net/10220/12096 |
| _version_ | 1811685389505658880 |
|---|---|
| author | Xin, Shi-Qing Quynh, Dao Thi Phuong Ying, Xiang He, Ying |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Xin, Shi-Qing Quynh, Dao Thi Phuong Ying, Xiang He, Ying |
| author_sort | Xin, Shi-Qing |
| collection | NTU |
| description | Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various types of defects. This paper presents a new algorithm to compute defect-tolerant geodesic distance on broken meshes. In contrast to the existing approaches which compute the distance from source to destinations in a single Dijkstra-like sweep, our method proceeds in an iterative and global manner. Thanks to its global nature, the resulting distance is tolerant to some defects (e.g. holes, gaps, shortcuts), insensitive to mesh tessellation/resolution, and robust to noise, which provides a meaningful approximation of geodesics on broken meshes. |
| first_indexed | 2024-10-01T04:43:45Z |
| format | Conference Paper |
| id | ntu-10356/97269 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:43:45Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/972692020-05-28T07:17:48Z A global algorithm to compute defect-tolerant geodesic distance Xin, Shi-Qing Quynh, Dao Thi Phuong Ying, Xiang He, Ying School of Computer Engineering Special Interest Group on GRAPHics and Interactive Techniques Asia Technical Briefs (5th : 2012 : Singapore) DRNTU::Engineering::Computer science and engineering Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various types of defects. This paper presents a new algorithm to compute defect-tolerant geodesic distance on broken meshes. In contrast to the existing approaches which compute the distance from source to destinations in a single Dijkstra-like sweep, our method proceeds in an iterative and global manner. Thanks to its global nature, the resulting distance is tolerant to some defects (e.g. holes, gaps, shortcuts), insensitive to mesh tessellation/resolution, and robust to noise, which provides a meaningful approximation of geodesics on broken meshes. 2013-07-24T03:51:47Z 2019-12-06T19:40:44Z 2013-07-24T03:51:47Z 2019-12-06T19:40:44Z 2012 2012 Conference Paper Xin, S.-Q., Quynh, D. T. P., Ying, X., & He, Y. (2012). A global algorithm to compute defect-tolerant geodesic distance. SIGGRAPH Asia 2012 Technical Briefs - SA '12. https://hdl.handle.net/10356/97269 http://hdl.handle.net/10220/12096 10.1145/2407746.2407769 en © 2012 ACM. |
| spellingShingle | DRNTU::Engineering::Computer science and engineering Xin, Shi-Qing Quynh, Dao Thi Phuong Ying, Xiang He, Ying A global algorithm to compute defect-tolerant geodesic distance |
| title | A global algorithm to compute defect-tolerant geodesic distance |
| title_full | A global algorithm to compute defect-tolerant geodesic distance |
| title_fullStr | A global algorithm to compute defect-tolerant geodesic distance |
| title_full_unstemmed | A global algorithm to compute defect-tolerant geodesic distance |
| title_short | A global algorithm to compute defect-tolerant geodesic distance |
| title_sort | global algorithm to compute defect tolerant geodesic distance |
| topic | DRNTU::Engineering::Computer science and engineering |
| url | https://hdl.handle.net/10356/97269 http://hdl.handle.net/10220/12096 |
| work_keys_str_mv | AT xinshiqing aglobalalgorithmtocomputedefecttolerantgeodesicdistance AT quynhdaothiphuong aglobalalgorithmtocomputedefecttolerantgeodesicdistance AT yingxiang aglobalalgorithmtocomputedefecttolerantgeodesicdistance AT heying aglobalalgorithmtocomputedefecttolerantgeodesicdistance AT xinshiqing globalalgorithmtocomputedefecttolerantgeodesicdistance AT quynhdaothiphuong globalalgorithmtocomputedefecttolerantgeodesicdistance AT yingxiang globalalgorithmtocomputedefecttolerantgeodesicdistance AT heying globalalgorithmtocomputedefecttolerantgeodesicdistance |