Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1629255.1629259acmotherconferencesArticle/Chapter ViewAbstractPublication PagesspmConference Proceedingsconference-collections
research-article

Repairing and meshing imperfect shapes with Delaunay refinement

Published: 05 October 2009 Publication History
  • Get Citation Alerts
  • Abstract

    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.

    References

    [1]
    G. Barequet, C. A. Duncan, and S. Kumar. RSVP: A geometric toolkit for controlled repair of solid models. IEEE Transactions on Visualization and Computer Graphics, 4(2):162--177, 1998.
    [2]
    G. Barequet and M. Sharir. Filling gaps in the boundary of a polyhedron. Computer Aided Geometric Design, 12(2):207--229, 1995.
    [3]
    S. Bischoff and L. Kobbelt. Structure preserving CAD model repair. Computer Graphics Forum, 24(3):527--536, 2005.
    [4]
    P. Borodin, M. Novotni, and R. Klein. Progressive gap closing for mesh repairing. In J. Vince and R. Earnshaw, editors, Advances in Modelling, Animation and Rendering, pages 201--213. Springer Verlag, July 2002.
    [5]
    G. Butlin and C. Stops. CAD data repair. In Proceedings of the 5th International Meshing Roundtable, pages 7--12, 1996.
    [6]
    CGAL. Computational Geometry Algorithms Library. http://www.cgal.org.
    [7]
    S.-W. Cheng, T. K. Dey, and E. A. Ramos. Delaunay refinement for piecewise smooth complexes. In N. Bansal, K. Pruhs, and C. Stein, editors, SODA, pages 1096--1105. SIAM, 2007.
    [8]
    L. P. Chew. Guaranteed-quality mesh generation for curved surfaces. In Symposium on Computational Geometry, pages 274--280, 1993.
    [9]
    C. S. Chong, A. S. Kumar, and H. P. Lee. Automatic mesh-healing technique for model repair and finite element model generation. Finite Elements in Analysis and Design, 43(15):1109--1119, 2007.
    [10]
    P. Degener and R. Klein. Texture atlas generation for inconsistent meshes and point sets. In Shape Modeling International, pages 156--168. IEEE Computer Society, 2007.
    [11]
    T. K. Dey. Curve and surface reconstruction: algorithms with mathematical analysis. Cambridge University Press, New York, 2007.
    [12]
    T. K. Dey and J. A. Levine. Delaunay meshing of piecewise smooth complexes without expensive predicates. Technical Report OSU-CISRC-7108-TR40, Department of CSE, The Ohio State University, July 2008.
    [13]
    H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge University Press, England, 2001.
    [14]
    A. Guéziec, G. Taubin, F. Lazarus, and W. Horn. Cutting and stitching: Converting sets of polygons to manifold surfaces. IEEE Transactions on Visualization and Computer Graphics, 7(2):136--151, 2001.
    [15]
    W. D. Henshaw. An algorithm for projecting points onto a patched CAD model. In Proceedings of the 10th International Meshing Roundtable, pages 353--362, 2001.
    [16]
    J. Hu, Y. K. Lee, T. Blacker, and J. Zhu. Overlay grid based geometry cleanup. In Proceedings of the 11th International Meshing Roundtable, pages 313--324, 2002.
    [17]
    T. Ju. Robust repair of polygonal models. ACM Transactions on Graphics, 23(3):888--895, 2004.
    [18]
    Y. K. Lee, C. K. Lim, H. Ghazialam, H. Vardhan, and E. Eklund. Surface mesh generation for dirty geometries by shrink wrapping using cartesian grid approach. In Proceedings of the 15th International Meshing Roundtable, pages 393--410, 2006.
    [19]
    A. A. Mezentsev and T. Woehler. Methods and algorithms of automated CAD repair for incremental surface meshing. In Proceedings of the 8th International Meshing Roundtable, pages 299--309, 1999.
    [20]
    T. M. Murali and T. A. Funkhouser. Consistent solid and boundary representations from arbitrary polygonal data. In ACM Symposium on Interactive 3D Graphics, pages 155--162, 196, 1997.
    [21]
    F. S. Nooruddin and G. Turk. Simplification and repair of polygonal models using volumetric techniques. IEEE Transactions on Visualization and Computer Graphics, 9(2):191--205, 2003.
    [22]
    P. S. Patel, D. L. Marcum, and M. G. Remotigue. Automatic CAD model topology generation. International Journal for Numerical Methods in Fluids, 52(8):823--841, 2006.
    [23]
    N. A. Petersson and K. K. Chand. Detecting translation errors in CAD surfaces and preparing geometries for mesh generation. In Proceedings of the 10th International Meshing Roundtable, pages 363--371, 2001.
    [24]
    J. Qi and V. Shapiro. Epsilon-regular sets and intervals. In International Conference on Shape Modeling and Applications (SMI 2005), pages 310--319, 2005.
    [25]
    A. Sheffer, M. Bercovier, T. D. Blacker, and J. Clements. Virtual topology operators for meshing. Int. J. Comput. Geometry Appl., 10(3):309--331, 2000.
    [26]
    X. Sheng and I. R. Meier. Generating topological structures for surface models. IEEE Computer Graphics and Applications, 15(6):35--41, 1995.
    [27]
    SISL. The SINTEF Spline Library. http://www.sintef.no/math_software.
    [28]
    J. P. Steinbrenner, N. J. Wyman, and J. R. Chawner. Fast surface meshing on imperfect CAD models. In IMR, pages 33--41, 2000.
    [29]
    Z. J. Wang and K. Srinivasan. An adaptive cartesian grid generation method for 'dirty' geometry. International Journal for Numerical Methods in Fluids, 39(8):703--717, 2002.

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    SPM '09: 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
    October 2009
    380 pages
    ISBN:9781605587110
    DOI:10.1145/1629255
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    • SIAM Activity Group on Geometric Design

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 05 October 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Delaunay mesh generation
    2. piecewise-smooth complexes
    3. shape repair
    4. topology

    Qualifiers

    • Research-article

    Funding Sources

    Conference

    SIAM '09
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 09 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Delaunay Meshing and Repairing of NURBS ModelsComputer Graphics Forum10.1111/cgf.1436240:5(125-142)Online publication date: 23-Aug-2021
    • (2020)Conversion of B-rep CAD models into globally G1 triangular splinesComputer Aided Geometric Design10.1016/j.cagd.2020.101832(101832)Online publication date: Mar-2020
    • (2019)TriWildACM Transactions on Graphics10.1145/3306346.332301138:4(1-15)Online publication date: 12-Jul-2019
    • (2016)Conversion of CAD models to loop subdivision surfacesProceedings of the 37th Annual Conference of the European Association for Computer Graphics: Posters10.5555/3059079.3059097(33-34)Online publication date: 9-May-2016
    • (2016)A line/trimmed NURBS surface intersection algorithm using matrix representationsComputer Aided Geometric Design10.1016/j.cagd.2016.07.00248:C(1-16)Online publication date: 1-Nov-2016
    • (2012)Hole filling of triangular mesh segments using systematic grey predictionComputer-Aided Design10.1016/j.cad.2012.07.00744:12(1182-1189)Online publication date: 1-Dec-2012
    • (2012)A BREP Model and Mesh Errors Detecting Tool: TopoVisuProduct Lifecycle Management. Towards Knowledge-Rich Enterprises10.1007/978-3-642-35758-9_42(468-477)Online publication date: 2012
    • (2012)3D anatomical shape atlas construction using mesh quality preserved deformable modelsProceedings of the 2012 international conference on Mesh Processing in Medical Image Analysis10.1007/978-3-642-33463-4_2(12-21)Online publication date: 1-Oct-2012
    • (2010)L Centroidal Voronoi Tessellation and its applicationsACM SIGGRAPH 2010 papers10.1145/1833349.1778856(1-11)Online publication date: 26-Jul-2010
    • (2010)L Centroidal Voronoi Tessellation and its applicationsACM Transactions on Graphics10.1145/1778765.177885629:4(1-11)Online publication date: 26-Jul-2010
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media