A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient Max-Norm Distance Computation and Reliable Voxelization
[article]
2003
Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing
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
doi:10.2312/sgp/sgp03/116-126
fatcat:pk52og4wovcjpgmw2yyncjtopi