DiFi: Fast 3D Distance Field Computation Using Graphics Hardware

Simple item page
dc.contributor.authorSud, Avneeshen_US
dc.contributor.authorOtaduy, Miguel A.en_US
dc.contributor.authorManocha, Dineshen_US
dc.date.accessioned2015-02-19T09:54:43Z
dc.date.available2015-02-19T09:54:43Z
dc.date.issued2004en_US
dc.description.abstractWe present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid baly rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used to cull and clamp the distance functions rendered for each slice. Our algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. We have used our algorithm to compute distance fields of large models composed of tens of thousands of primitives on high resolution grids. Moreover, we demonstrate its application to medial axis evaluation and proximity computations. As compared to earlier approaches, we are able to achieve an order of magnitude improvement in the running time.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Distance fields, Voronoi regions, graphics hardware, proximity computationsen_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume23en_US
dc.identifier.doi10.1111/j.1467-8659.2004.00787.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages557-566en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2004.00787.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleDiFi: Fast 3D Distance Field Computation Using Graphics Hardwareen_US
Files
Collections
23-Issue 3