Efficient intersection tests for objects defined constructively
International Journal of Robotics Research
Refinement methods for geometric bounds in constructive solid geometry
ACM Transactions on Graphics (TOG)
A null-object detection algorithm for constructive solid geometry
Communications of the ACM
Approximation hierarchies and S-bounds
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Computing CSG tree boundaries as algebraic expressions
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
A model for efficient and flexible image computing
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Bridging the gap between CSG and Brep via a triple ray representation
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
A New Space Subdivision for Ray Tracing CSG Solids
IEEE Computer Graphics and Applications
Enhancing sense of reality by efficient and precise collision detection in virtual environments
ICDHM'07 Proceedings of the 1st international conference on Digital human modeling
| Hi-index | 0.00 |
Testing for intersection between geometric entities in ray casting is normally performed by intersecting a ray (a semi-infinite line) against the surface elements of a geometric model. Simple reasoning about the extent of each geometric entity significantly reduces the time required by such algorithms. If the ray and the geometric entities are boxed, one first tests to see whether the box around the ray and the box around a geometric entity overlap. Only if the boxes overlap does one continue to test to determine whether the ray and the entity overlap. A way to add boxes, called the S-bounds method, is described, and work to data on extending it is summarized. The method is useful for interference-detection and collision-detection problems.