Primitive Trees for Precomputed Distance Queries

Simple item page
dc.contributor.authorLee, Sung-Hoen_US
dc.contributor.authorPark, Taejungen_US
dc.contributor.authorKim, Chang-Hunen_US
dc.contributor.editorI. Navazo, P. Poulinen_US
dc.date.accessioned2015-02-28T15:25:21Z
dc.date.available2015-02-28T15:25:21Z
dc.date.issued2013en_US
dc.description.abstractWe propose the primitive tree, a novel and compact space-partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade-off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self-intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12062en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.subjectBoundary representationsen_US
dc.titlePrimitive Trees for Precomputed Distance Queriesen_US
Files
Collections
32-Issue 2
Full Papers 2013 - CGF 32-Issue 2