Efficient Minimum Distance Computation for Solids of Revolution

Simple item page
dc.contributor.authorSon, Sang-Hyunen_US
dc.contributor.authorYoon, Seung-Hyunen_US
dc.contributor.authorKim, Myung-Sooen_US
dc.contributor.authorElber, Gershonen_US
dc.contributor.editorPanozzo, Daniele and Assarsson, Ulfen_US
dc.date.accessioned2020-05-24T12:54:07Z
dc.date.available2020-05-24T12:54:07Z
dc.date.issued2020
dc.description.abstractWe present a highly efficient algorithm for computing the minimum distance between two solids of revolution, each of which is defined by a planar cross-section region and a rotation axis. The boundary profile curve for the cross-section is first approximated by a bounding volume hierarchy (BVH) of fat arcs. By rotating the fat arcs around the axis, we generate the BVH of fat tori that bounds the surface of revolution. The minimum distance between two solids of revolution is then computed very efficiently using the distance between fat tori, which can be boiled down to the minimum distance computation for circles in the three-dimensional space. Our circle-based approach to the solids of revolution has distinctive features of geometric simplification. The main advantage is in the effectiveness of our approach in handling the complex cases where the minimum distance is obtained in non-convex regions of the solids under consideration. Though we are dealing with a geometric problem for solids, the algorithm actually works in a computational style similar to that of handling planar curves. Compared with conventional BVH-based methods, our algorithm demonstrates outperformance in computing speed, often 10-100 times faster. Moreover, the minimum distance can be computed very efficiently for the solids of revolution under deformation, where the dynamic reconstruction of fat arcs dominates the overall computation time and takes a few milliseconds.en_US
dc.description.number2
dc.description.sectionheadersSpatial Queries
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume39
dc.identifier.doi10.1111/cgf.13950
dc.identifier.issn1467-8659
dc.identifier.pages535-544
dc.identifier.urihttps://doi.org/10.1111/cgf.13950
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13950
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectComputing methodologies
dc.subjectMinimum distance computation
dc.subjectSolid of revolution
dc.subjectBounding volume hierarchy
dc.subjectFat arc
dc.subjectToroidal patch
dc.subjectDeformation
dc.subjectAcceleration
dc.titleEfficient Minimum Distance Computation for Solids of Revolutionen_US
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
v39i2pp535-544.pdf
Size:
5.55 MB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
paper1093_crc_video.mpg
Size:
167.92 MB
Format:
Moving Picture Experts Group
Download
Collections
39-Issue 2