Skip to main content

Removing Self Intersections of a Triangular Mesh by Edge Swapping, Edge Hammering, and Face Lifting

  • Conference paper

Abstract

This paper describes a computational method for removing self intersections of a triangular mesh. A self intersection is a situation where a part of a surface mesh collides with another part of itself, i.e., two mesh elements intersect each other. It destroys the integrity of the mesh and makes the mesh unusable for certain applications. A mesh generator often creates a self intersection when a relatively large element size is specified over a region with a narrow clearance. There has been no automated method that automatically removes self intersections, and such self intersections needed to be corrected by manually editing the mesh. The proposed method automatically resolves a self intersection by re-connecting edges and adjusting node locations. This technique removes a typical self intersection and recovers the integrity of the triangular mesh. Experimental results show the effectiveness of the proposed method.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barequet, G., Sharir, M.: Filling Gaps in the Boundary of a Polyhedron. Computer Aided Geometric Design 12, 207–229 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barequet, G., Kumar, S.: Repairing CAD Models. In: Proceedings of IEEE Visualization 1997, pp. 363–370 (1997)

    Google Scholar 

  3. Gueziec, A., Taubin, G., Lazarus, F., Horn, B.: Cutting and Stitching: Converting Sets of Polygons to Manifold Surface. IEEE Transactions on Visualization and Computer Graphics 7, 136–151 (2001)

    Article  Google Scholar 

  4. Branch, J., Prieto, F., Boulanger, P.: A Hole-Filling Algorithm for Triangular Meshes Using Local Radial Basis Function. In: Proceedings of 15th International Meshing Roundtable, pp. 411–431 (2006)

    Google Scholar 

  5. Li, F., Chen, B., Leng, W.-h.: A Hole Repairing Method for Triangle Mesh Surfaces. In: Proceedings of International Conference on Computational Intelligence and Security, pp. 972–975 (2006)

    Google Scholar 

  6. Ribelles, J., Heckbert, P., Garland, M., Stahovich, T., Srivastava, V.: Finding and Removing Features from Polyhedra. In: Proceedings of ASME Design Automation Conference (2001)

    Google Scholar 

  7. Lee, K.Y., Armstrong, C.G., Price, M.A., Lamont, J.H.: A Small Feature Suppression/Unsuppression System for Preparing B-Rep Models for Analysis. In: Proceedings of ACM Symposium on Solid and Physical Modeling, pp. 113–124 (2005)

    Google Scholar 

  8. Nomura, M., Hamada, N.: Feature Edge Extraction from 3D Triangular Meshes Using a Thinning Algorithm. In: Proceedings of SPIE - Vision Geometry X, pp. 34–41 (2001)

    Google Scholar 

  9. Jiao, X., Heath, M.T.: Feature Detection for Surface Meshes. In: Proceedings of 8th International Conference on Numerical Grid Generation in Computational Field Simulations, pp. 705–714 (2002)

    Google Scholar 

  10. Baker, T.J.: Identification and Preservation of Surface Features. In: Proceedings of 13th International Meshing Roundtable, pp. 299–309 (2004)

    Google Scholar 

  11. Yoshizawa, S., Belyaev, A., Seidel, H.-P.: Fast and Robust Detection of Crest Lines on Meshes. In: Proceedings of ACM Symposium on Solid and Physical Modeling, pp. 227–232 (2005)

    Google Scholar 

  12. Yamakawa, S., Shimada, K.: Polygon Crawling: Feature-Edge Extraction from a General Polygonal Surface for Mesh Generation. In: Proceedings of 14th International Meshing Roundtable, pp. 257–275 (2005)

    Google Scholar 

  13. Jiao, X.: Volume and Feature Preservation in Surface Mesh Optimization. In: Proceedings of 15th International Meshing Roundtable, pp. 359–373 (2006)

    Google Scholar 

  14. Quadros, W.R., Vyas, V., Brewer, M., Owen, S.J., Shimada, K.: A Computational Framework for Generating Sizing Function in Assembly Meshing. In: Proceedings of 14th International Meshing Roundtable, pp. 55–72 (2005)

    Google Scholar 

  15. Glimm, J., Simanca, S.R., Tan, D., Tangerman, F.M., Vanderwoude, G.: Front Tracking Simulations of Ion Deposition and Resputtering. SIAM Journal on Scientific Computing 20, 1905–1920 (1999)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamakawa, S., Shimada, K. (2009). Removing Self Intersections of a Triangular Mesh by Edge Swapping, Edge Hammering, and Face Lifting. In: Clark, B.W. (eds) Proceedings of the 18th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04319-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04319-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04318-5

  • Online ISBN: 978-3-642-04319-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics