File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Determining directional contact range of two convex polyhedra

TitleDetermining directional contact range of two convex polyhedra
Authors
KeywordsSigned distance
Separating distance
Penetrating distance
Duality transformation
Directional contact range
Convex polyhedra
Issue Date2008
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 5th International Conference on Geometric Modeling and Processing (GMP 2008), Hangzhou, China, 23-25 April 2008. In Lecture Notes in Computer Science, 2008, v. 4975, p. 127-142 How to Cite?
AbstractThe directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in collision. Using the contact range, one can quickly classify the positions along a line for a polyhedron as "safe" for free of collision with another polyhedron, or "unsafe" for the otherwise. This kind of contact detection between two objects is important in CAD, computer graphics and robotics applications. In this paper we propose a robust and efficient computation scheme to determine the directional contact range of two polyhedra. We consider the problem in its dual equivalence by studying the Minkowski difference of the two polyhedra under a duality transformation. The algorithm requires the construction of only a subset of the faces of the Minkowski difference, and resolves the directional range efficiently. It also computes the contact configurations when the boundaries of the polyhedra are in contact. © 2008 Springer-Verlag Berlin Heidelberg.
DescriptionLNCS v. 4975 entitled: Advances in geometric modeling and processing: 5th International Conference, GMP 2008 ... proceedings
Persistent Identifierhttp://hdl.handle.net/10722/93222
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorChoi, YKen_HK
dc.contributor.authorLi, Xen_HK
dc.contributor.authorRong, Fen_HK
dc.contributor.authorWang, WPen_HK
dc.contributor.authorCameron, Sen_HK
dc.date.accessioned2010-09-25T14:54:35Z-
dc.date.available2010-09-25T14:54:35Z-
dc.date.issued2008en_HK
dc.identifier.citationThe 5th International Conference on Geometric Modeling and Processing (GMP 2008), Hangzhou, China, 23-25 April 2008. In Lecture Notes in Computer Science, 2008, v. 4975, p. 127-142en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93222-
dc.descriptionLNCS v. 4975 entitled: Advances in geometric modeling and processing: 5th International Conference, GMP 2008 ... proceedings-
dc.description.abstractThe directional contact range of two convex polyhedra is the range of positions that one of the polyhedron may locate along a given straight line so that the two polyhedra are in collision. Using the contact range, one can quickly classify the positions along a line for a polyhedron as "safe" for free of collision with another polyhedron, or "unsafe" for the otherwise. This kind of contact detection between two objects is important in CAD, computer graphics and robotics applications. In this paper we propose a robust and efficient computation scheme to determine the directional contact range of two polyhedra. We consider the problem in its dual equivalence by studying the Minkowski difference of the two polyhedra under a duality transformation. The algorithm requires the construction of only a subset of the faces of the Minkowski difference, and resolves the directional range efficiently. It also computes the contact configurations when the boundaries of the polyhedra are in contact. © 2008 Springer-Verlag Berlin Heidelberg.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectSigned distanceen_HK
dc.subjectSeparating distanceen_HK
dc.subjectPenetrating distanceen_HK
dc.subjectDuality transformationen_HK
dc.subjectDirectional contact rangeen_HK
dc.subjectConvex polyhedraen_HK
dc.titleDetermining directional contact range of two convex polyhedraen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChoi, YK: lykchoi@hku.hken_HK
dc.identifier.emailWang, WP: wenping@cs.hku.hken_HK
dc.identifier.authorityChoi, YK=rp00106en_HK
dc.identifier.authorityWang, WP=rp00186en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-70349338794en_HK
dc.identifier.hkuros164928en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70349338794&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume4975en_HK
dc.identifier.spage127en_HK
dc.identifier.epage142en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridCameron, S=7202227863en_HK
dc.identifier.scopusauthoridWang, W=35147101600en_HK
dc.identifier.scopusauthoridRong, F=26423881600en_HK
dc.identifier.scopusauthoridLi, X=7501701381en_HK
dc.identifier.scopusauthoridChoi, YK=7404777348en_HK
dc.customcontrol.immutablesml 140729-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats