Abstract

An algorithm is presented for efficiently removing loops from triangular meshes which represent moving surfaces in integrated circuit fabrication process simulation. Tliis algorithm has O(N log N+Ni log Ni) time for meshes normally encountered, where N is the number of triangles in the mesh and Ni is the number of pairs of intersecting triangles. A spatial sort based on an octtree data structure is used to determine the region of surface self intersection. Triangles are cut into smaller triangles so that the surface self intersection region occurs along mesh edges and loop removal is facilitated. A simplified version of the algorithm is deqonstrated on some test cases, and results are discussed.

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 call

Disclaimer: 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.