File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Complete Classification and Efficient Determination of Arrangements Formed by Two Ellipsoids

TitleComplete Classification and Efficient Determination of Arrangements Formed by Two Ellipsoids
Authors
KeywordsArrangements
collision detection
ellipsoids
Issue Date2020
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://tog.acm.org
Citation
ACM Transactions on Graphics, 2020, v. 39 n. 3, p. article no. 27 How to Cite?
AbstractArrangements of geometric objects refer to the spatial partitions formed by the objects, and they serve as an underlining structure of motion design, analysis, and planning in CAD/CAM, robotics, molecular modeling, manufacturing, and computer-assisted radio-surgery. Arrangements are especially useful to collision detection, which is a key task in various applications such as computer animation, virtual reality, computer games, robotics, CAD/CAM, and computational physics. Ellipsoids are commonly used as bounding volumes in approximating complex geometric objects in collision detection. In this article, we present an in-depth study on the arrangements formed by two ellipsoids. Specifically, we present a classification of these arrangements and propose an efficient algorithm for determining the arrangement formed by any particular pair of ellipsoids. A stratification diagram is also established to show the connections among all the arrangements formed by two ellipsoids. Our results, for the first time, elucidate all possible relative positions between two arbitrary ellipsoids and provide an efficient and robust algorithm for determining the relative position of any two given ellipsoids, therefore providing the necessary foundation for developing practical and trustworthy methods for processing ellipsoids for collision analysis or simulation in various applications.
Persistent Identifierhttp://hdl.handle.net/10722/293924
ISSN
2020 Impact Factor: 5.414
2015 SCImago Journal Rankings: 2.552
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorJia, X-
dc.contributor.authorTu, C-
dc.contributor.authorMourrain, B-
dc.contributor.authorWang, W-
dc.date.accessioned2020-11-23T08:23:49Z-
dc.date.available2020-11-23T08:23:49Z-
dc.date.issued2020-
dc.identifier.citationACM Transactions on Graphics, 2020, v. 39 n. 3, p. article no. 27-
dc.identifier.issn0730-0301-
dc.identifier.urihttp://hdl.handle.net/10722/293924-
dc.description.abstractArrangements of geometric objects refer to the spatial partitions formed by the objects, and they serve as an underlining structure of motion design, analysis, and planning in CAD/CAM, robotics, molecular modeling, manufacturing, and computer-assisted radio-surgery. Arrangements are especially useful to collision detection, which is a key task in various applications such as computer animation, virtual reality, computer games, robotics, CAD/CAM, and computational physics. Ellipsoids are commonly used as bounding volumes in approximating complex geometric objects in collision detection. In this article, we present an in-depth study on the arrangements formed by two ellipsoids. Specifically, we present a classification of these arrangements and propose an efficient algorithm for determining the arrangement formed by any particular pair of ellipsoids. A stratification diagram is also established to show the connections among all the arrangements formed by two ellipsoids. Our results, for the first time, elucidate all possible relative positions between two arbitrary ellipsoids and provide an efficient and robust algorithm for determining the relative position of any two given ellipsoids, therefore providing the necessary foundation for developing practical and trustworthy methods for processing ellipsoids for collision analysis or simulation in various applications.-
dc.languageeng-
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://tog.acm.org-
dc.relation.ispartofACM Transactions on Graphics-
dc.rightsACM Transactions on Graphics. Copyright © Association for Computing Machinery, Inc.-
dc.rights©ACM, YYYY. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)} http://doi.acm.org/10.1145/nnnnnn.nnnnnn-
dc.subjectArrangements-
dc.subjectcollision detection-
dc.subjectellipsoids-
dc.titleComplete Classification and Efficient Determination of Arrangements Formed by Two Ellipsoids-
dc.typeArticle-
dc.identifier.emailWang, W: wenping@cs.hku.hk-
dc.identifier.authorityWang, W=rp00186-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/3388540-
dc.identifier.scopuseid_2-s2.0-85086563252-
dc.identifier.hkuros318986-
dc.identifier.volume39-
dc.identifier.issue3-
dc.identifier.spagearticle no. 27-
dc.identifier.epagearticle no. 27-
dc.identifier.isiWOS:000577126000010-
dc.publisher.placeUnited States-
dc.identifier.issnl0730-0301-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats