메뉴 건너뛰기




Volumn 36, Issue 3, 2004, Pages 279-288

Sculptured surface machining using triangular mesh slicing

Author keywords

Regional milling; Sculptured surface machining; Triangular mesh projection; Triangular mesh slicing

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; MILLING (MACHINING); SURFACE TREATMENT;

EID: 0344063354     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(03)00114-3     Document Type: Article
Times cited : (80)

References (14)
  • 4
    • 0002417208 scopus 로고    scopus 로고
    • A fast triangle-triangle intersection test
    • Tomas M., Prosolvia C.A.B. A fast triangle-triangle intersection test. J Graph Tools. 2:(2):1997;25-30.
    • (1997) J Graph Tools , vol.2 , Issue.2 , pp. 25-30
    • Tomas, M.1    Prosolvia, C.A.B.2
  • 5
    • 0035311963 scopus 로고    scopus 로고
    • 3D collision detection: A survey
    • Jimenez P., Thomas F., Torras C. 3D collision detection: a survey. Comput Graph. 25:(2):2001;269-285.
    • (2001) Comput Graph , vol.25 , Issue.2 , pp. 269-285
    • Jimenez, P.1    Thomas, F.2    Torras, C.3
  • 7
    • 0036530722 scopus 로고    scopus 로고
    • Polygonal chain intersection
    • Park S.C., Shin H. Polygonal chain intersection. Comput Graph. 26:(2):2002;341-350.
    • (2002) Comput Graph , vol.26 , Issue.2 , pp. 341-350
    • Park, S.C.1    Shin, H.2
  • 8
    • 0033878947 scopus 로고    scopus 로고
    • Tool-path planning for direction-parallel area milling
    • Park S.C., Choi B.K. Tool-path planning for direction-parallel area milling. Comput Aid Des. 32:(1):2000;17-25.
    • (2000) Comput Aid Des , vol.32 , Issue.1 , pp. 17-25
    • Park, S.C.1    Choi, B.K.2
  • 9
    • 0035399777 scopus 로고    scopus 로고
    • Boundary extraction algorithm for cutting area detection
    • Park S.C., Choi B.K. Boundary extraction algorithm for cutting area detection. Comput Aid Des. 33:(8):2001;571-579.
    • (2001) Comput Aid Des , vol.33 , Issue.8 , pp. 571-579
    • Park, S.C.1    Choi, B.K.2
  • 10
    • 0001383353 scopus 로고    scopus 로고
    • A pair-wise offset algorithm for 2D point-sequence curve
    • Choi B.K., Park S.C. A pair-wise offset algorithm for 2D point-sequence curve. Comput Aid Des. 31:(12):1999;735-745.
    • (1999) Comput Aid Des , vol.31 , Issue.12 , pp. 735-745
    • Choi, B.K.1    Park, S.C.2
  • 11
    • 0035452557 scopus 로고    scopus 로고
    • Uncut-free pocketing tool-paths generation using pair-wise offset algorithm
    • Park S.C., Choi B.K. Uncut-free pocketing tool-paths generation using pair-wise offset algorithm. Comput Aid Des. 33:(10):2001;739-746.
    • (2001) Comput Aid Des , vol.33 , Issue.10 , pp. 739-746
    • Park, S.C.1    Choi, B.K.2
  • 12
    • 0037016281 scopus 로고    scopus 로고
    • Offset tool-path linking for pocket machining
    • Park S.C., Chung Y.C. Offset tool-path linking for pocket machining. Comput Aid Des. 34:(4):2002;299-308.
    • (2002) Comput Aid Des , vol.34 , Issue.4 , pp. 299-308
    • Park, S.C.1    Chung, Y.C.2
  • 13
    • 0018515704 scopus 로고
    • Algorithms for reporting and counting geometric intersections
    • Bentley J.L., Ottmann T.A. Algorithms for reporting and counting geometric intersections. IEEE Trans Comput. 28:1979;643-647.
    • (1979) IEEE Trans Comput , vol.28 , pp. 643-647
    • Bentley, J.L.1    Ottmann, T.A.2
  • 14
    • 0026926870 scopus 로고
    • Monotone pieces of chains, ORSA
    • Chandru V., Rajan V.T., Swaminathan R. Monotone pieces of chains, ORSA. J Comput. 4:(4):1992;439-446.
    • (1992) J Comput , vol.4 , Issue.4 , pp. 439-446
    • Chandru, V.1    Rajan, V.T.2    Swaminathan, R.3


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