Path Planning References
Submitted by Evan Malone on Wed, 10/22/2008 - 19:26
- Yang Y., Loh H.T., Fuh J.Y.H., Wang Y.G. (2002), "Equidistant path generation fo improved scanning efficiency in layered manufacturing", Rapid Prototyping Journal, V8, N1, pp. 30-37. Abstract: Path generation is an important factor that affects the quality and efficiency of most laminated manufacturing processes such as SLS, SLA and FDM. This paper introduces an efficient path generation algorithm. The principle of the algorithm and its implementation are presented. A comparative study is used to analyze the effectiveness of this method. The results of comparison on both path length and processing time between the traditional method and the proposed method are discussed.
- S.C. Park, B.K. Choi (2001), "Boundary extraction algorithm for cutting area detection", Computer-Aided Design, V33, p571-579. Abstract: In sculptured surface machining, many machining operations require cutting areas to be expressed in terms of a boundary representation. To extract cutting areas from a sculptured surface, this paper employs a regular grid model (Z-map model) and presents a procedure extracting areas from a Z-map model. The extracted areas may correspond to various machining features, depending on what the Z-map stores, such as curvature (fillet, uncut area), slope (wall, floor) and Z-values (contour). The core of the procedure is a "boundary extraction algorithm" extracting boundaries and identifying the inclusion relationships among the boundaries from a binary image. The time complexity of the boundary extraction algorithm is O(n), where n is the number of runs. In terms of its time complexity and simplicity, the proposed algorithm has advantages over the prior ones. Empirical tests show the performance of the proposed algorithm.
| Attachment | Size |
|---|---|
| YangY2002RapidPrototypingJournal.pdf | 328.27 KB |
| SCParkBKChoi2001ComputerAidedDesign.pdf | 1.07 MB |
»
- Login to post comments