메뉴 건너뛰기




Volumn 100, Issue 1, 2000, Pages 30-35

Incremental algorithms for finding the offset distance and minimum passage width in a pocket machining toolpath using the Voronoi technique

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; CONTOUR FOLLOWERS; METAL WORKING SHAPERS;

EID: 0033892204     PISSN: 09240136     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0924-0136(99)00425-2     Document Type: Article
Times cited : (22)

References (6)
  • 2
    • 0020152763 scopus 로고
    • Medial axis transformation of a planar shape
    • Lee D.T. Medial axis transformation of a planar shape. IEEE. Trans. Pattern Anal. Machine Intell. PAMI-4(4):1982;363-369.
    • (1982) IEEE. Trans. Pattern Anal. Machine Intell. , vol.4 , Issue.4 , pp. 363-369
    • Lee, D.T.1
  • 3
    • 0343075966 scopus 로고
    • A straightforward algorithm for computing the medial axis of a simple polygon
    • Yao C., Rokne J. A straightforward algorithm for computing the medial axis of a simple polygon. Int. J. Comput. Math. 39:1990;51-60.
    • (1990) Int. J. Comput. Math. , vol.39 , pp. 51-60
    • Yao, C.1    Rokne, J.2
  • 4
    • 0023349608 scopus 로고
    • Voronoi diagrams for multiply-connected polygonal domains I: Algorithm
    • Srinivasan V., Nackman L. Voronoi diagrams for multiply-connected polygonal domains I: algorithm. IBM J. Res. Dev. 31(3):1987;361-372.
    • (1987) IBM J. Res. Dev. , vol.31 , Issue.3 , pp. 361-372
    • Srinivasan, V.1    Nackman, L.2
  • 5
    • 0023346064 scopus 로고
    • Voronoi diagrams for multiply-connected polygonal domains II: Implementation and application
    • Meshkat S., Sakkas C. Voronoi diagrams for multiply-connected polygonal domains II: implementation and application. IBM J. Res. Dev. 31(3):1987;373-381.
    • (1987) IBM J. Res. Dev. , vol.31 , Issue.3 , pp. 373-381
    • Meshkat, S.1    Sakkas, C.2
  • 6
    • 0343075965 scopus 로고
    • A fast incremental algorithm for computing the Voronoi diagram of a planar shape
    • Springer, Berlin
    • M. Held, A fast incremental algorithm for computing the Voronoi diagram of a planar shape, Communicating with Virtual Worlds CGI'93, Springer, Berlin, 1993, pp. 318-329.
    • (1993) Communicating with Virtual Worlds CGI'93 , pp. 318-329
    • Held, M.1


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