An Implementation of Triangle-triangle Intersection for Qualitative Spatial Reasoning
Abstract
The intersection between 3D objects is ubiquitous in modeling. The objects are represented using the Boundary Representation (ANSI Brep) model in many applications such as CAD/CAM, collision detection, and spatial reasoning. Detection of possible intersection between objects can be based on the objects' boundaries (approximate triangulations), computing triangle-triangle intersection. Usually there are separate algorithms for cross and coplanar intersections. The intersection detection is a byproduct of actual intersection computations. For qualitative spatial reasoning, intersection detection is sufficient, actual intersection is not necessary. Herein we present an implementation of a complete uniform integrated algorithm independent of cross and coplanar intersection. Additionally, we use barycentric coordinates for detecting and classifying intersections prior to computing precise 3D coordinates. This work is applicable to most region connection calculi, particularly VRCC-3D+, which uses intersection detection between 3D objects as well as their projections in 2D that are essential for occlusion detection.
Recommended Citation
C. Sabharwal and J. Leopold, "An Implementation of Triangle-triangle Intersection for Qualitative Spatial Reasoning," 29th International Conference on Computers and Their Applications, CATA 2014, pp. 23 - 28, Curran Associates, Inc., Jan 2014.
Department(s)
Computer Science
Keywords and Phrases
Classification predicates; Intersection detection; Spatial reasoning; Triangle-triangle intersection
International Standard Book Number (ISBN)
978-163266513-3
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Curran Associates, Inc., All rights reserved.
Publication Date
01 Jan 2014