Efficient Max-Norm Distance Computation and Reliable Voxelization release_pk52og4wovcjpgmw2yyncjtopi

by Gokul Varadhan, Shankar Krishnan, Young J. Kim, Suhas Diggavi, Dinesh Manocha

Published in Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing by The Eurographics Association.

2003  

Abstract

We present techniques to efficiently compute the distance under max-norm between a point and a wide class of geometric primitives. We formulate the distance computation as an optimization problem and use this framework to design efficient algorithms for convex polytopes, algebraic primitives and triangulated models. We extend them to handle large models using bounding volume hierarchies, and use rasterization hardware followed by local refinement for higher-order primitives. We use the max-norm distance computation algorithm to design a reliable voxel-intersection test to determine whether the surface of a primitive intersects a voxel.We use this test to perform reliable voxelization of solids and generate adaptive distance fields that provides a Hausdorff distance guarantee between the boundary of the original primitives and the reconstructed surface.
In text/plain format

Archived Files and Locations

application/pdf  2.0 MB
file_ibqgppxwmfccnn2q2sbo7g5gly
gamma.cs.unc.edu (web)
web.archive.org (webarchive)
application/pdf  2.1 MB
file_z5s6caqdwjbuha24cons3hecoq
diglib.eg.org (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   published
Year   2003
Language   en ?
Proceedings Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  1727-8384
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 15baf7ab-70ee-4832-b166-e80651878ac9
API URL: JSON