Abstract
This paper is concerned with designing an efficient algorithm for computing the intersection of two unstructured meshes. The algorithm uses a background quadtree from the first unstructured mesh and a self-avoiding walk (SAW) from the second unstructured mesh. Due to the relationships between neighboring consecutive triangles in the triangle sequence of a SAW, we can track the location of each triangle in the second unstructured mesh by means of a background quadtree. This allows us to design an approximately linear time algorithm for computing the mesh intersection. Experiments show that our efficient algorithm for computing the mesh intersection saves considerable execution time when compared to other algorithms. We also present two new SAWs. Using our first-in-first-out (FIFO) SAW saves an additional 5% in the execution time over other SAWs as our FIFO SAW employs better data locality, which is especially beneficial to hierarchical-memory computer architectures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
