Boundary extraction algorithm for cutting area detection

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 361
  • Download : 0
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. (C) 2001 Elsevier Science Ltd. All rights reserved.
Publisher
ELSEVIER SCI LTD
Issue Date
2001-07
Language
English
Article Type
Article
Keywords

GENERATION; PATH; DIE

Citation

COMPUTER-AIDED DESIGN, v.33, no.8, pp.571 - 579

ISSN
0010-4485
URI
http://hdl.handle.net/10203/81510
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0