Generating topological structures for surface models

Sheng, Xuejun; Meier, I.R.

doi:10.1109/38.469517

Cited by 35 publications

(13 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The edge-split operation makes the vertex pair contraction [22,23] and expansion operations more reliable and accurate, and allows to process the models with non-uniform spacing. It seems many previous e orts [13][14][15][16][17][18] assume that geometry models to be processed are two-manifold or use some special procedure to be able to handle non-manifold model like a two-manifold model. This assumption poses many restrictions not only the input model topology type but also on the processing algorithm design.…”

Section: Algorithm Overviewmentioning

confidence: 99%

See 1 more Smart Citation

Automatic CAD model topology generation

Patel

Marcum

Remotigue

2006

Numerical Methods in Fluids

View full text Add to dashboard Cite

SUMMARYComputer aided design (CAD) models often need to be processed due to the data translation issues and requirements of the downstream applications like computational ÿeld simulation, rapid prototyping, computer graphics, computational manufacturing, and real-time rendering before they can be used. Automatic CAD model processing tools can signiÿcantly 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 ÿlling, 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 exible. In addition, a spatial data structure is used for searching and neighbour ÿnding to process large models e ciently. In this way, the combination of generality, accuracy, and e ciency of this algorithm seems to be a signiÿcant improvement over existing techniques. Results are presented showing the e ectiveness of the algorithm to process two-and three-dimensional conÿgurations.

show abstract

Section: Algorithm Overviewmentioning

confidence: 99%

“…Makela and Dolenc [14] developed methods to handle overlapping and intersecting triangles e ciently. Sheng and Meier [15] have used a technique based on incremental matching and merging of boundaries of surface models to repair gaps. Morvan and Fadel [16] developed a virtual environment to correct the errors in a given model interactively.…”

mentioning

confidence: 99%

Automatic CAD model topology generation

Patel

Marcum

Remotigue

2006

Numerical Methods in Fluids

View full text Add to dashboard Cite

show abstract

“…Other approaches stitch the gaps between boundary curves of surface elements [2,14]. Some researchers move or merge vertices of polylines approximating the boundary curves [4,9,26]. Others suggest combinations of the three approaches [22].…”

Section: Shape Repairmentioning

confidence: 99%

Repairing and meshing imperfect shapes with Delaunay refinement

Busaryev

Dey

Levine

2009

2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling

View full text Add to dashboard Cite

As a direct consequence of software quirks, designer errors, and representation flaws, often three-dimensional shapes are stored in formats that introduce inconsistencies such as small gaps and overlaps between surface patches. We present a new algorithm that simultaneously repairs imperfect geometry and topology while generating Delaunay meshes of these shapes. At the core of this approach is a meshing algorithm for input shapes that are piecewise smooth complexes (PSCs), a collection of smooth surface patches meeting at curves non-smoothly or in non-manifold configurations. Guided by a user tolerance parameter, we automatically merge nearby components while building a Delaunay mesh that has many of these errors fixed. Experimental evidence is provided to show the results of our algorithm on common computer-aided design (CAD) formats. Our algorithm may also be used to simplify shapes by removing small features which would require an excessive number of elements to preserve them in the output mesh.

show abstract

“…Barequet and Sharir [12] showed that finding the triangle strip that minimizes a global function (such as total edge lengths) is an NP-hard problem, and used a heuristic search instead for an approximate solution. Similar distance measures have been used to guide the merging of vertices on the two sides of the gap [70,78,11,21,63]. The method of Borodin et.…”

Section: Filling Gapsmentioning

confidence: 99%

Fixing Geometric Errors on Polygonal Models: A Survey

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Polygonal models are popular representations of 3D objects. The use of polygonal models in computational applications often requires a model to properly bound a 3D solid. That is, the polygonal model needs to be closed, manifold, and free of self-intersections. This paper surveys a sizeable literature for repairing models that do not satisfy this criteria, focusing on categorizing them by their methodology and capability. We hope to offer pointers to further readings for researchers and practitioners, and suggestions of promising directions for future research endeavors.

show abstract

Generating topological structures for surface models

Cited by 35 publications

References 7 publications

Automatic CAD model topology generation

Automatic CAD model topology generation

Repairing and meshing imperfect shapes with Delaunay refinement

Fixing Geometric Errors on Polygonal Models: A Survey

Contact Info

Product

Resources

About