메뉴 건너뛰기




Volumn 18, Issue 6, 2012, Pages 879-889

Efficiently computing exact geodesic loops within finite steps

Author keywords

Discrete geodesic; geodesic loop; triangular mesh

Indexed keywords

AVERAGE NUMBERS; CLOSED GEODESICS; DIFFERENTIAL GEOMETRY; DIFFERENTIAL TOPOLOGY; DISCRETE GEODESIC; EFFICIENT ALGORITHM; EXISTENCE AND UNIQUENESS; FACE SEQUENCES; FINITE STEPS; GEODESIC CURVATURES; GEODESIC LOOP; GEOMETRIC SHAPE; NUMERICAL SOLVERS; POLYGONAL SURFACE; SHAPE SEGMENTATION; SMOOTH SURFACE; SPACE COMPLEXITY; TIME COMPLEXITY; TRIANGULAR MESHES;

EID: 84862777416     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2011.119     Document Type: Article
Times cited : (32)

References (38)
  • 1
    • 14844346171 scopus 로고    scopus 로고
    • Geodesics-based one-to-one parameterization of 3D triangle meshes
    • DOI 10.1109/MMUL.2005.5
    • H. Lee, Y. Tong, and M. Desbrun, "Geodesics-Based One-to-One Parameterization of 3D Triangle Meshes," IEEE Multimedia, vol. 12, no. 1, pp. 27-33, Jan. 2005. (Pubitemid 40351836)
    • (2005) IEEE Multimedia , vol.12 , Issue.1 , pp. 27-33
    • Lee, H.1    Tong, Y.2    Desbrun, M.3
  • 2
    • 33646881516 scopus 로고    scopus 로고
    • Geodesic remeshing using front propagation
    • DOI 10.1007/s11263-006-6859-3, Variational Geometric and LS Methods (VLSM 2003)
    • G. Peyré and L.D. Cohen, "Geodesic Remeshing Using Front Propagation," Int'l J. Computer Vision, vol. 69, no. 1, pp. 145-156, 2006. (Pubitemid 43787408)
    • (2006) International Journal of Computer Vision , vol.69 , Issue.1 , pp. 145-156
    • Peyre, G.1    Cohen, L.D.2
  • 6
    • 77952860185 scopus 로고    scopus 로고
    • Mesh snapping: Robust interactive mesh cutting using fast geodesic curvature flow
    • J. Zhang, C. Wu, J. Cai, J. Zheng, and X.-C. Tai, "Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow," Computer Graphics Forum, vol. 29, no. 2, pp. 517-526, 2010.
    • (2010) Computer Graphics Forum , vol.29 , Issue.2 , pp. 517-526
    • Zhang, J.1    Wu, C.2    Cai, J.3    Zheng, J.4    Tai, X.-C.5
  • 7
    • 0022663554 scopus 로고
    • On shortest paths in polyhedral spaces
    • M. Sharir and A. Schorr, "On Shortest Paths in Polyhedral Spaces," SIAM J. Computing, vol. 15, no. 1, pp. 193-215, 1986.
    • (1986) SIAM J. Computing , vol.15 , Issue.1 , pp. 193-215
    • Sharir, M.1    Schorr, A.2
  • 9
    • 70349101325 scopus 로고    scopus 로고
    • Improving chen and han's algorithm on the discrete geodesic problem
    • S.-Q. Xin and G.-J. Wang, "Improving Chen and Han's Algorithm on the Discrete Geodesic Problem," ACM Trans. Graphics, vol. 28, no. 4, pp. 1-8, 2009.
    • (2009) ACM Trans. Graphics , vol.28 , Issue.4 , pp. 1-8
    • Xin, S.-Q.1    Wang, G.-J.2
  • 10
    • 84980073426 scopus 로고
    • On the iteration of closed geodesics and the sturm intersection theory
    • R. Bott, "On the Iteration of Closed Geodesics and the Sturm Intersection Theory," Comm. Pure and Applied Math., vol. 9, no. 2, pp. 171-206, 1956.
    • (1956) Comm. Pure and Applied Math. , vol.9 , Issue.2 , pp. 171-206
    • Bott, R.1
  • 14
    • 59049099304 scopus 로고    scopus 로고
    • Part-type segmentation of articulated voxel-shapes using the junction rule
    • D. Reniers and A. Telea, "Part-Type Segmentation of Articulated Voxel-Shapes Using the Junction Rule," Proc. Pacific Graphics, 2008.
    • (2008) Proc. Pacific Graphics
    • Reniers, D.1    Telea, A.2
  • 17
    • 36549049433 scopus 로고    scopus 로고
    • Computing shortest cycles using universal covering space
    • DOI 10.1007/s00371-007-0169-9
    • X. Yin, M. Jin, and X. Gu, "Computing Shortest Cycles Using Universal Covering Space," The Visual Computer, vol. 23, no. 12, pp. 999-1004, 2007. (Pubitemid 350178422)
    • (2007) Visual Computer , vol.23 , Issue.12 , pp. 999-1004
    • Yin, X.1    Jin, M.2    Gu, X.3
  • 18
    • 79957820969 scopus 로고    scopus 로고
    • Paint mesh cutting
    • L. Fan, L. Liu, and K. Liu, "Paint Mesh Cutting," Computer Graphics Forum, vol. 30, no. 2, pp. 603-612, 2011.
    • (2011) Computer Graphics Forum , vol.30 , Issue.2 , pp. 603-612
    • Fan, L.1    Liu, L.2    Liu, K.3
  • 19
    • 77952744478 scopus 로고    scopus 로고
    • A level set formulation of geodesic curvature flow on simplicial surfaces
    • July/Aug.
    • C. Wu and X. Tai, "A Level Set Formulation of Geodesic Curvature Flow on Simplicial Surfaces," IEEE Trans. Visualization and Computer Graphics, vol. 16, no. 4, pp. 647-662, July/Aug. 2010.
    • (2010) IEEE Trans. Visualization and Computer Graphics , vol.16 , Issue.4 , pp. 647-662
    • Wu, C.1    Tai, X.2
  • 20
  • 22
    • 0002851510 scopus 로고    scopus 로고
    • Straightest geodesics on polyhedral surfaces
    • Springer Verlag
    • K. Polthier and M. Schmies, "Straightest Geodesics on Polyhedral Surfaces," Mathematical Visualization, p. 391, Springer Verlag, 1998.
    • (1998) Mathematical Visualization , pp. 391
    • Polthier, K.1    Schmies, M.2
  • 24
    • 36448948684 scopus 로고    scopus 로고
    • Efficiently determining a locally exact shortest path on polyhedral surfaces
    • DOI 10.1016/j.cad.2007.08.001, PII S0010448507001959
    • S.-Q. Xin and G.-J. Wang, "Efficiently Determining a Locally Exact Shortest Path on Polyhedral Surfaces," Computer-Aided Design, vol. 39, no. 12, pp. 1081-1090, 2007. (Pubitemid 350166328)
    • (2007) CAD Computer Aided Design , vol.39 , Issue.12 , pp. 1081-1090
    • Xin, S.-Q.1    Wang, G.-J.2
  • 26
    • 0033482190 scopus 로고    scopus 로고
    • Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
    • S. Har-Peled, "Approximate Shortest paths and Geodesic Diameter on a Convex Polytope in Three Dimensions," Discrete and Computational Geometry, vol. 21, no. 2, pp. 217-231, 1999.
    • (1999) Discrete and Computational Geometry , vol.21 , Issue.2 , pp. 217-231
    • Har-Peled, S.1
  • 28
    • 24644468669 scopus 로고    scopus 로고
    • Geodesic curvature flow on parametric surfaces
    • A. Spira and R. Kimmel, "Geodesic Curvature Flow on Parametric Surfaces," Proc. Curve and Surface Design, pp. 365-373, 2002.
    • (2002) Proc. Curve and Surface Design , pp. 365-373
    • Spira, A.1    Kimmel, R.2
  • 32
    • 78651291759 scopus 로고    scopus 로고
    • Interactive mesh cutting using constrained random walks
    • Mar.
    • J. Zhang, J. Zheng, and J. Cai, "Interactive Mesh Cutting Using Constrained Random Walks," IEEE Trans. Visualization and Computer Graphics, vol. 17, no. 3, pp. 357-367, Mar. 2011.
    • (2011) IEEE Trans. Visualization and Computer Graphics , vol.17 , Issue.3 , pp. 357-367
    • Zhang, J.1    Zheng, J.2    Cai, J.3
  • 33
    • 77952792487 scopus 로고    scopus 로고
    • Mesh decomposition with cross-boundary brushes
    • Y. Zheng and C.-L. Tai, "Mesh Decomposition with Cross-Boundary Brushes," Computer Graphics Forum, vol. 29, no. 2, pp. 527-535, 2010.
    • (2010) Computer Graphics Forum , vol.29 , Issue.2 , pp. 527-535
    • Zheng, Y.1    Tai, C.-L.2
  • 36
    • 33745059395 scopus 로고
    • Ein Beweis des sa€tzes Von Edelheit u€ber Konvexe Mengen
    • S. Kakutani, "Ein Beweis des sa€tzes Von Edelheit u€ber Konvexe Mengen," Proc. Imp. Acad. Tokyo 13, pp. 93-94, 1937.
    • (1937) Proc. Imp. Acad. Tokyo , vol.13 , pp. 93-94
    • Kakutani, S.1
  • 37
    • 34347327055 scopus 로고    scopus 로고
    • Computing general geometric structures on surfaces using Ricci flow
    • DOI 10.1016/j.cad.2007.05.006, PII S0010448507001182
    • M. Jin, F. Luo, and X.D. Gu, "Computing General Geometric Structures on Surfaces Using Ricci Flow," Computer-Aided Design, vol. 39, no. 8, pp. 663-675, 2007. (Pubitemid 47016476)
    • (2007) CAD Computer Aided Design , vol.39 , Issue.8 , pp. 663-675
    • Jin, M.1    Luo, F.2    Gu, X.D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.