메뉴 건너뛰기




Volumn 26, Issue 1, 1995, Pages 41-59

Application of computational geometry in optimizing 2.5D and 3D NC surface machining

Author keywords

CAD CAM; Computational geometry; Convex hull; Cutter path generation; Machining time estimation; NC; Process planning

Indexed keywords

CONVEX HULL; CUTTER PATH GENERATION; PROCESS PLANNING;

EID: 0029292489     PISSN: 01663615     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-3615(95)80005-0     Document Type: Article
Times cited : (62)

References (43)
  • 4
    • 0028720745 scopus 로고
    • Using virtual boundaries for the planning and machining of protrusion free-form features
    • (1994) Computers in Industry , vol.25 , pp. 173-187
    • Lee1    Chang2
  • 5
    • 0026173269 scopus 로고
    • Determining feasible tool-approach directions for machining Bezier curves and surfaces
    • (1991) Comput.-Aid. Des. , vol.23 , Issue.5 , pp. 367-379
    • Tseng1    Joshi2
  • 6
    • 0004229086 scopus 로고
    • Computational Geometry
    • Department of Computer Science, Yale University, New Haven, CT
    • (1978) Ph.D. thesis
    • Shamos1
  • 8
    • 0343830486 scopus 로고
    • Computational geometry and software engineering: Towards a geometric computing environment
    • D.F. Rogers, R.A. Earnshaw, Springer-Verlag, New York
    • (1987) Techniques for Computer Graphics , pp. 23-37
    • Forrest1
  • 10
    • 0023952676 scopus 로고
    • An O(n log log n)-time algorithm for triangulating a simple polygon
    • (1988) SIAM J. Comput. , vol.17 , Issue.1 , pp. 143-178
    • Tarjan1    Van Wyk2
  • 14
    • 0024774782 scopus 로고
    • An optimal visibility graph algorithm for triangulated simple polygons
    • (1989) Algorithmica , vol.4 , pp. 141-155
    • Hershberger1
  • 15
    • 52449147986 scopus 로고
    • On the geodesic Voronoi diagram of point sites in a simple polygon
    • (1989) Algorithmica , vol.4 , pp. 109-140
    • Aronov1
  • 17
    • 0016534815 scopus 로고
    • Determining The minimum-area encasing rectangle for an arbitrary closed curve
    • (1975) Commun. ACM , vol.18 , Issue.7 , pp. 409-413
    • Freeman1    Shapira2
  • 18
    • 0026139149 scopus 로고
    • Parallel implementation of 3D convex-hull algorithm
    • (1991) Comput.-Aid. Des. , vol.23 , Issue.3 , pp. 177-188
    • Day1
  • 21
    • 0017453547 scopus 로고
    • Convex hulls of a finite set of points in two and three dimensions
    • (1977) Commun. ACM , vol.20 , Issue.2 , pp. 87-93
    • Preparata1    Hong2
  • 22
    • 0008059731 scopus 로고
    • Automatic planning and programming for 5-axis sculptured surface machining
    • School of Industrial Engineering, Purdue University, West Lafayette, IN
    • (1993) Ph.D. Thesis
    • Lee1
  • 23
    • 0028393138 scopus 로고
    • Pocket machining based on contour-parallel tool paths generated by means of proximity maps
    • (1994) Comput.-Aid. Des. , vol.26 , Issue.3 , pp. 189-203
    • Held1    Lukacs2    Andor3
  • 27
    • 0024069579 scopus 로고
    • An analytical approach to optimize NC tool path planning for face milling flat convex polygonal surfaces
    • (1988) IIE Trans. , vol.20 , Issue.3 , pp. 325-332
    • Wang1    Chang2    Wysk3
  • 32
    • 0026253809 scopus 로고
    • Automatic cutter selection and optimal cutter path generation for prismatic parts
    • (1991) Int. J. Prod. Res. , vol.29 , Issue.11 , pp. 2163-2176
    • Bala1    Chang2
  • 38
    • 0026882277 scopus 로고
    • Cut distribution and cutter selection for sculptured surface cavity machining
    • (1992) Int. J. Prod. Res. , vol.30 , Issue.6 , pp. 1447-1470
    • Lee1    Choi2    Chang3
  • 40
    • 0022075730 scopus 로고
    • Recursive algorithms for the representation of parametric curves and surfaces
    • (1985) Comput.-Aid. Des. , vol.17 , Issue.5 , pp. 225-229
    • Piegl1
  • 42
    • 0026203887 scopus 로고
    • CASCAM—An automated system for sculptured surface cavity machining
    • (1991) Computers in Industry , vol.16 , Issue.4 , pp. 321-342
    • Lee1    Chang2


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