z-logo
Premium
Automatic CAD model topology generation
Author(s) -
Patel Paresh S.,
Marcum David L.,
Remotigue Michael G.
Publication year - 2006
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.1166
Subject(s) - image stitching , cad , computer science , computer aided design , topology (electrical circuits) , computer graphics , algorithm , solid modeling , engineering drawing , theoretical computer science , artificial intelligence , mathematics , engineering , combinatorics , operating system
Computer aided design (CAD) models often need to be processed due to the data translation issues and requirements of the downstream applications like computational field simulation, rapid prototyping, computer graphics, computational manufacturing, and real‐time rendering before they can be used. Automatic CAD model processing tools can significantly reduce the amount of time and cost associated with the manual processing. The topology generation algorithm, commonly known as CAD repairing/healing, is presented to detect commonly found geometrical and topological issues like cracks, gaps, overlaps, intersections, T‐connections, and no/invalid topology in the model, process them and build correct topological information. The present algorithm is based on the iterative vertex pair contraction and expansion operations called stitching and filling , respectively, to process the model accurately. Moreover, the topology generation algorithm can process manifold as well as non‐manifold models, which makes the procedure more general and flexible. In addition, a spatial data structure is used for searching and neighbour finding to process large models efficiently. In this way, the combination of generality, accuracy, and efficiency of this algorithm seems to be a significant improvement over existing techniques. Results are presented showing the effectiveness of the algorithm to process two‐ and three‐dimensional configurations. Copyright © 2006 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here