Name
Abstract | ||
|---|---|---|
We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a state-of-the-art approach, our method offers more than an order of magnitude speedup and achieves a tighter approximation in terms of volume difference with the original solid while using fewer spheres. The spheres generated by our method are internal and tangent to the solid's boundary, which permits an exact error analysis, fast updates under local feature size preserving deformation, and conservative dilation. We show that our dilated spheres offer superior time and error performance in approximate separation distance tests than the state-of-the-art method for sphere set approximation for the class of (\sigma, \theta )-fat solids. We envision that our sphere-based approximation will also prove useful for a range of other applications, including shape matching and shape segmentation. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TPAMI.2011.254 | IEEE Trans. Pattern Anal. Mach. Intell. |
Keywords | Field | DocType |
measurement uncertainty,algorithms,three dimensional,solids,computer simulation,image segmentation,upper bound,shape,medial axis,computer graphics | Upper and lower bounds,Mathematical analysis,Medial axis,SPHERES,Voronoi diagram,Artificial intelligence,Geometry,Speedup,Dilation (morphology),Pattern recognition,Local feature size,Tangent,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 6 | 0162-8828 |
Citations | PageRank | References |
13 | 0.62 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svetlana Stolpner | 1 | 51 | 3.78 |
| Paul G. Kry | 2 | 604 | 53.77 |
| Kaleem Siddiqi | 3 | 3259 | 242.07 |