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. 1.
|
1560
|
Robot Motion Planning
– Latombe
- 1991
|
|
503
|
A volumetric method for building complex models from range images
– Curless, Levoy
- 1996
|
|
447
|
Surface reconstruction from unorganized points
– Hoppe, DeRose, et al.
- 1992
|
|
244
|
Spatial Tessellations. Concepts and Applications of Voronoi Diagrams. J.Wiley
– Okabe, Sugihara
- 1992
|
|
185
|
Interior point polynomial methods in convex programming: Theory and algorithms
– Nesterov, Nemirovsky
- 1993
|
|
185
|
Small-dimensional linear programming and convex hulls made easy
– Seidel
- 1991
|
|
165
|
Adaptively sampled distance fields: a general representation of shape for computer graphics
– Frisken, Perry, et al.
- 2000
|
|
145
|
Collision detection between geometric models: a survey
– LIN, GOTTSCHALK
- 1998
|
|
128
|
Robust and Optimal Control
– Zhou, Doyle, et al.
- 1996
|
|
124
|
Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware
– Hoff, Culver, et al.
- 1999
|
|
114
|
Dual contouring of hermite data
– Ju, Losasso, et al.
|
|
91
|
Cornhill. Octree-based decimation of marching cubes surfaces
– Shekhar, Fayyad, et al.
- 1996
|
|
84
|
Feature-based methods for large scale dynamic programming
– Tsitsiklis, Roy
- 1996
|
|
72
|
Marching cubes: A high resolution 3d surface construction algorithm
– Lorensen, Cline
- 1987
|
|
72
|
Kizamu: a system for sculpting digital characters
– Perry, Frisken
- 2001
|
|
70
|
Guaranteed Ray Intersections with Implicit Functions
– Kalra, Barr
- 1989
|
|
68
|
Accurate and fast proximity queries between polyhedra using convex surface decomposition
– Ehmann, Lin
- 2001
|
|
53
|
2001, ‘Max-norm projections for factored MDPs
– Guestrin, Koller, et al.
|
|
45
|
Distance transformations: Fast algorithms and applications to medical image processing
– Cuisenaire
- 1999
|
|
44
|
Determining the minimum translational distance between two convex polyhedra
– Cameron, Culley
- 1986
|
|
41
|
Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom
– Boissonnat, Sharir, et al.
- 1998
|
|
40
|
Volume Sampled Voxelization of Geometric Primitives
– Wang, Kaufman
- 1993
|
|
38
|
Alias-Free Voxelization of Geometric Objects
– Sramek, Kaufman
- 1999
|
|
38
|
Volume-sampled 3D modeling
– Wang, Kaufman
- 1994
|
|
37
|
Feature-sensitive surface extraction from volume data
– Kobbelt, Botsch, et al.
- 2001
|
|
34
|
Collision and proximity queries
– Lin, Manocha
- 2004
|
|
34
|
Solving systems of polynomial Equations
– Manocha
- 1994
|
|
27
|
Straight skeletons for general polygonal figures in the plane
– Aichholzer, Aurenhammer
- 1996
|
|
19
|
Numerical computation of polynomial zeros by means of aberth’s method
– Bini
- 1996
|
|
17
|
Simplification and repair of polygonal models using volumetric techniques
– NOORUDDIN, TURK
- 1999
|
|
15
|
Physically-based modeling
– BARAFF, WITKIN
- 2001
|
|
13
|
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
– Chew, Kedem, et al.
- 1998
|
|
13
|
Mathematical definition of tolerance specifications
– Requicha
- 1993
|
|
13
|
Feature-sensitive subdivision and isosurface reconstruction
– Varadhan, Krishnan, et al.
- 2003
|
|
9
|
Precise: Efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
– Krishnan, Foskey, et al.
- 2000
|
|
8
|
Proximity and Applications in General Metrics
– Gavrilova
- 1998
|
|
6
|
M.: Polyhedral Voronoi diagrams of polyhedra in three dimensions
– Koltun, Sharir
- 2002
|
|
5
|
Using distance maps for smooth representation in sampled volumes
– GIBSON
- 1998
|
|
5
|
3dma general users manual
– Lindquist
- 1999
|
|
3
|
Robust and Convex Optimization with Application in Finance
– Lobo
- 2000
|
|
2
|
Applications of computational algebraic geometry
– Cox, Sturmfels
- 1998
|
|
1
|
Supercover 3d polygon
– Andres, Sibata, et al.
- 1996
|
|
1
|
Air profile optimization in the fast positive force transient control
– Ghaoui
- 1999
|
|
1
|
A fast triangle-triangle intersection test
– Möllwer, AB
- 1997
|
|
1
|
The l∞-voronoi diagram of segments and vlsi applications
– Papadopoulou, Lee
- 2001
|
