메뉴 건너뛰기




Volumn 43, Issue 11, 2011, Pages 1468-1476

Efficiently computing geodesic offsets on triangle meshes by the extended XinWang algorithm

Author keywords

Discrete geodesics; Exact algorithm; Geodesic distance field; Geodesic offsets

Indexed keywords

ASYMPTOTIC TIME COMPLEXITY; COMPLICATED GEOMETRY; DIFFERENTIAL GEOMETRY; DISCRETE GEODESIC; EXACT ALGORITHM; EXACT ALGORITHMS; GEODESIC DISTANCE FIELD; GEODESIC OFFSETS; LARGE-SCALE MODELS; NC-MACHINING; PIECEWISE LINEAR; SOLID-MODELING; SPACE COMPLEXITY; TOOLPATHS; TRIANGLE MESH; UNDERLYING SURFACE;

EID: 80054698964     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2011.08.027     Document Type: Article
Times cited : (19)

References (38)
  • 3
    • 0018533130 scopus 로고
    • Algorithm for planning collision-free paths among polyhedral obstacles
    • DOI 10.1145/359156.359164
    • T. Lozano-Perez, and M. Wesley An algorithm for planning collision free paths amongst polyhedral obstacles Communications of the ACM 25 9 1979 560 570 (Pubitemid 10424755)
    • (1979) Communications of the ACM , vol.22 , Issue.10 , pp. 560-570
    • Lozano-Perez, T.1    Wesley, M.A.2
  • 6
    • 0029328132 scopus 로고
    • A new machine strategy for sculptured surfaces using offset surface
    • K.I. Kim, and K. Kim A new machine strategy for sculptured surfaces using offset surface International Journal of Production Research 33 6 1995 1683 1697
    • (1995) International Journal of Production Research , vol.33 , Issue.6 , pp. 1683-1697
    • Kim, K.I.1    Kim, K.2
  • 7
  • 9
    • 0032623741 scopus 로고    scopus 로고
    • Computing offsets of NURBS curves and surfaces
    • L.A. Piegl, and W. Tiller Computing offsets of NURBS curves and surfaces Computer-Aided Design 31 2 1999 147 156
    • (1999) Computer-Aided Design , vol.31 , Issue.2 , pp. 147-156
    • Piegl, L.A.1    Tiller, W.2
  • 12
    • 79952826292 scopus 로고    scopus 로고
    • Accurate computation of geodesic distance fields for polygonal curves on triangle meshes
    • Bommes D, Kobbelt L. Accurate computation of geodesic distance fields for polygonal curves on triangle meshes. In: VMV'07. 2007. p. 15160.
    • (2007) VMV'07 , pp. 15160
    • Bommes, D.1    Kobbelt, L.2
  • 14
    • 70349101325 scopus 로고    scopus 로고
    • Improving Chen and Han's algorithm on the discrete geodesic problem
    • 104:1104:8
    • S.-Q. Xin, and G.-J. Wang Improving Chen and Han's algorithm on the discrete geodesic problem ACM Transactions on Graphics 28 2009 104:1104:8
    • (2009) ACM Transactions on Graphics , vol.28
    • Xin, S.-Q.1    Wang, G.-J.2
  • 15
    • 0022663554 scopus 로고
    • On shortest paths in polyhedral spaces
    • M. Sharir, and A. Schorr On shortest paths in polyhedral spaces SIAM Journal on Computing 15 1 1986 193 215
    • (1986) SIAM Journal on Computing , vol.15 , Issue.1 , pp. 193-215
    • Sharir, M.1    Schorr, A.2
  • 20
    • 0031175637 scopus 로고    scopus 로고
    • Approximating shortest paths on a convex polytope in three dimensions
    • P.K. Agarwal, S. Har-Peled, M. Sharir, and K.R. Varadarajan Approximating shortest paths on a convex polytope in three dimensions Journal of the ACM 44 4 1997 567 584 (Pubitemid 127617704)
    • (1997) Journal of the ACM , vol.44 , Issue.4 , pp. 567-584
    • Agarwal, P.K.1    Har-Peled, S.2    Sharir, M.3    Varadarajan, K.R.4
  • 22
    • 0031997974 scopus 로고    scopus 로고
    • A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices
    • M. Barbehenn A note on the complexity of Dijkstra's algorithm for graphs with weighted vertices IEEE Transactions on Computers 47 2 1998 263 (Pubitemid 128737459)
    • (1998) IEEE Transactions on Computers , vol.47 , Issue.2 , pp. 263
    • Barbehenn, M.1
  • 24
    • 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 & Computational Geometry 21 2 1999 217 231
    • (1999) Discrete & Computational Geometry , vol.21 , Issue.2 , pp. 217-231
    • Har-Peled, S.1
  • 26
    • 24644468669 scopus 로고    scopus 로고
    • Geodesic curvature flow on parametric surfaces
    • A. Spira, and R. Kimmel Geodesic curvature flow on parametric surfaces Curve and surface design 2002 365 373
    • (2002) Curve and Surface Design , pp. 365-373
    • Spira, A.1    Kimmel, R.2
  • 28
    • 0022076833 scopus 로고
    • An algorithm for shortest-path motion in three dimensions
    • C.H. Papadimitriou An algorithm for shortest-path motion in three dimensions Information Processing Letters 20 5 1985 259 263
    • (1985) Information Processing Letters , vol.20 , Issue.5 , pp. 259-263
    • Papadimitriou, C.H.1
  • 31
    • 0002851510 scopus 로고    scopus 로고
    • Springer Verlag [Chapter] Straightest geodesics on polyhedral surfaces, p. 391
    • K. Polthier, and M. Schmies Mathematical visualization 1998 Springer Verlag [Chapter] Straightest geodesics on polyhedral surfaces, p. 391
    • (1998) Mathematical Visualization
    • Polthier, K.1    Schmies, M.2
  • 33
    • 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 39 12 2007 1081 1090 (Pubitemid 350166328)
    • (2007) CAD Computer Aided Design , vol.39 , Issue.12 , pp. 1081-1090
    • Xin, S.-Q.1    Wang, G.-J.2
  • 34
    • 80054696671 scopus 로고    scopus 로고
    • Efficiently computing exact geodesic loops within finite steps
    • Los Alamitos, CA, USA: IEEE Computer Society in press
    • Xin S-Q, He Y, Fu C-W. Efficiently computing exact geodesic loops within finite steps. IEEE Transactions on Visualization and Computer Graphics, vol. 99. Los Alamitos, CA, USA: IEEE Computer Society, 2011 [in press].
    • (2011) IEEE Transactions on Visualization and Computer Graphics , vol.99
    • Xin, S.-Q.1    He, Y.2    Fu, C.-W.3
  • 35
    • 38249011793 scopus 로고
    • Offset curves and surfaces: A brief survey
    • B. Pham Offset curves and surfaces: a brief survey Computer-Aided Design 24 4 1992 223 229
    • (1992) Computer-Aided Design , vol.24 , Issue.4 , pp. 223-229
    • Pham, B.1
  • 37
    • 0032676954 scopus 로고    scopus 로고
    • An overview of offset curves and surfaces
    • T. Maekawa An overview of offset curves and surfaces Computer-Aided Design 31 3 1999 165 173
    • (1999) Computer-Aided Design , vol.31 , Issue.3 , pp. 165-173
    • Maekawa, T.1
  • 38
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E.W. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1


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