| Journal: | Polibits |
| Database: | PERIÓDICA |
| System number: | 000374533 |
| ISSN: | 1870-9044 |
| Authors: | Sabharwal, Chaman L1 Leopold, Jennifer L1 McGeehan, Douglas1 |
| Institutions: | 1Missouri University of Science and Technology, Rolla, Missouri. Estados Unidos de América |
| Year: | 2013 |
| Season: | Jul-Dic |
| Number: | 48 |
| Pages: | 13-22 |
| Country: | México |
| Language: | Inglés |
| Document type: | Artículo |
| Approach: | Aplicado, descriptivo |
| English abstract | 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 |
| Disciplines: | Ciencias de la computación |
| Keyword: | 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 |
| Full text: | Texto completo (Ver HTML) |
