In a set of new developed integrated expert numerical control system of CAD/CAM, to satisfy the special request for the intellectual process on the figures in CAD section, we designed an algorithm to retrieve minimum irregular closures from DXF and DWG files automatically. A new kind of data structure identifying angle-wing-edge-structure is established. By applying special linearizing operation to this kind of data structure, we can describe all elements of graph. Then the new algorithm for yielding all minimum closures and the maximum outer contour is showed. An example is provided to elaborate this procedure. The time complexity of the algorithm is O(n2) so that it can improve the intelligence of CAD system. Having been used by our customers, it is proved that this method works very well. In addition, it is also easy for us to apply it to computational geometry, pattern recognition, path analysis, curve generating, and so on.
- Design Engineering Division and Computers and Information in Engineering Division
A New Algorithm of Minimum Irregular Closure Retrieving
- Views Icon Views
- Share Icon Share
- Search Site
Zeng, Y, Zhang, Y, Cheng, G, Lv, P, Yu, J, Qi, J, Chen, H, & Qiu, Y. "A New Algorithm of Minimum Irregular Closure Retrieving." Proceedings of the ASME 2004 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 4: 24th Computers and Information in Engineering Conference. Salt Lake City, Utah, USA. September 28–October 2, 2004. pp. 637-644. ASME. https://doi.org/10.1115/DETC2004-57715
Download citation file: