Triangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
Título del documento: Triangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
Revista: Polibits
Base de datos: PERIÓDICA
Número de sistema: 000374533
ISSN: 1870-9044
Autores: 1
1
1
Instituciones: 1Missouri University of Science and Technology, Rolla, Missouri. Estados Unidos de América
Año:
Periodo: Jul-Dic
Número: 48
Paginación: 13-22
País: México
Idioma: Inglés
Tipo de documento: Artículo
Enfoque: Aplicado, descriptivo
Resumen en inglés In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model Detection of possible intersection between objects can be based on the objects' boundaries (ie., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection detection algorithm for both cross and coplanar intersections. For qualitative spatial reasoning, a general-purpose algorithm is desirable for accurately differentiating the relations in a region connection calculus, a task that requires consideration of intersection between objects. Herein we present a complete uniform integrated algorithm for both cross and coplanar intersection. Additionally, we present parametric methods for classifying and computing intersection points. This work is applicable to most region connection calculi, particularly VRCC-3D+, which detects intersections between 3D objects as well as their projections in 2D that are essential for occlusion detection
Disciplinas: Ciencias de la computación
Palabras clave: Procesamiento de datos,
CAD,
Software,
Razonamiento espacial,
Detección de intersecciones,
Intersección triángulo-triángulo
Keyword: Computer science,
Data processing,
CAD,
Software,
Spatial reasoning,
Intersection detection,
Triangle-triangle intersection
Texto completo: Texto completo (Ver HTML)