English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30536
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Reducing feasible contacts between polyhedral models to red-blue intersections on the sphere

AuthorsJiménez Schlegl, Pablo ; Torras, Carme
Issue Date2003
CitationComputer-Aided Design 35(7): 693-705 (2003)
AbstractOrientation-related problems in geometric design can be naturally expressed on the spherical surface S2 . A wide subset of such problems can be solved directly on the sphere by adapting well-known planar data structures and algorithms. This paper shows that the detection of feasible contacts between two translating polyhedral models can be formulated as a problem of this type. First, a dual spherical representation of polyhedra is introduced, which reduces the contact detection above to finding intersections between two sets of spherical polygons. Next, the red-blue blocks plane sweep algorithm is adapted to obtain both edge intersections and point-in-polygon inclusions in the spherical setting. An experimental comparison of this algorithm against a naive one shows an increasing advantage of the former as the complexity of the setting grows. The obtained edge-edge and vertex-face polyhedral contacts provide the relevant feature pairs to be tested for interference, leading to considerable savings in collision detection between polyhedral models, as shown in the experimental test performed.
Publisher version (URL)http://dx.doi.org/10.1016/S0010-4485(02)00099-4
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.