Abstract

Testing whether a point is inside a solid is a basic operation in computer graphics. This document presents a variety of strategies for triangle meshes, a widely used data structure in computer graphics. We discuss some issues about the capabilities of each approach depending on the situation, taking into account memory and CPU usage. A practical comparison of the performance of several strategies is also presented, with implementation issues and time tables showing the performance of each algorithm. The tests highlight the strengths and weaknesses of each approach.

Full Text
Published version (Free)

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