Introduction to Solid Modeling
Introduction to Solid Modeling
A theorem to determine the spatial containment of a point in a planar polyhedron
Computer Vision, Graphics, and Image Processing
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Solid representation and operation using extended octrees
ACM Transactions on Graphics (TOG)
An efficient ray-polygon intersection
Graphics gems
An introduction to ray tracing
An introduction to ray tracing
Computational geometry in C
Fast, minimum storage ray-triangle intersection
Journal of Graphics Tools
Michael Abrash's Graphics Programming Black Book, with CD: The Complete Works of Graphics Master, Michael Abrash
Front-to-Back Display of BSP Trees
IEEE Computer Graphics and Applications
Computer
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Layer-Based Representation of Polyhedrons for Point Containment Tests
IEEE Transactions on Visualization and Computer Graphics
Improved Binary Space Partition merging
Computer-Aided Design
A new point containment test algorithm based on preprocessing and determining triangles
Computer-Aided Design
Fast and accurate evaluation of regularized Boolean operations on triangulated solids
Computer-Aided Design
| Hi-index | 0.00 |
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.