Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/30536
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Jiménez Schlegl, Pablo | - |
dc.contributor.author | Torras, Carme | - |
dc.date.accessioned | 2010-12-17T13:07:56Z | - |
dc.date.available | 2010-12-17T13:07:56Z | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | Computer-Aided Design 35(7): 693-705 (2003) | - |
dc.identifier.issn | 0010-4485 | - |
dc.identifier.uri | http://hdl.handle.net/10261/30536 | - |
dc.description.abstract | Orientation-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. | - |
dc.description.sponsorship | This work was supported by the project 'Computación mediante restricciones en robótica y gestión de recursos' (070-725). This research has been partially supported by the Spanish Science and Technology Commission (CICYT) under contract TAP99-1086-C03-01 (project ‘Constraint-based computation in robotics and resource allocation’) and the Catalan Research Commission, through the ‘Robotics and Control’ group. | - |
dc.language.iso | eng | - |
dc.publisher | Elsevier | - |
dc.rights | closedAccess | - |
dc.subject | Contac | - |
dc.subject | Orientation | - |
dc.subject | Polyhedra | - |
dc.title | Reducing feasible contacts between polyhedral models to red-blue intersections on the sphere | - |
dc.type | artículo | - |
dc.identifier.doi | 10.1016/S0010-4485(02)00099-4 | - |
dc.description.peerreviewed | Peer Reviewed | - |
dc.relation.publisherversion | http://dx.doi.org/10.1016/S0010-4485(02)00099-4 | - |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | artículo | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Aparece en las colecciones: | (IRII) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
4
checked on 20-abr-2024
WEB OF SCIENCETM
Citations
3
checked on 25-feb-2024
Page view(s)
308
checked on 24-abr-2024
Download(s)
55
checked on 24-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.