A robust segment/triangle intersection algorithm for interference tests. Efficiency study

DOI10.1016/J.COMGEO.2009.10.001zbMATH Open1185.65035OpenAlexW2099548533MaRDI QIDQ2269834FDOQ2269834

Authors: Juan J. Jiménez, Rafael J. Segura, Francisco R. Feito 

Publication date: 11 March 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.10.001

Recommendations

• ERIT—A Collection of Efficient and Reliable Intersection Tests
• How trivial are reliable box-plane intersections?
• scientific article; zbMATH DE number 1294045
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• A vertex algorithm for collision detection

zbMATH Keywords

numerical examplesalgorithmbarycentric coordinatescollision detectioninterference testmoving polyhedral solidsrejection testsegment/triangle intersection

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Dimension-independent modeling with simplicial complexes
• Towards exact geometric computation

Cited In (3)

• From theoretical graphic objects to real free-form solids
• Uncollided flux techniques for arbitrary finite element meshes
• An embedded flexible polyhedron with nonconstant dihedral angles

This page was built for publication: A robust segment/triangle intersection algorithm for interference tests. Efficiency study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269834)