ACM Home Page
Please provide us with feedback. Feedback
Approximate medial axis as a voronoi subcomplex
Full text PdfPdf (1.19 MB)
Source ACM Symposium on Solid and Physical Modeling archive
Proceedings of the seventh ACM symposium on Solid modeling and applications table of contents
Saarbrücken, Germany
SESSION: Geometric Reasoning table of contents
Pages: 356 - 366  
Year of Publication: 2002
ISBN:1-58113-506-8
Authors
Tamal K. Dey  Ohio State University, Columbus, OH
Wulue Zhao  Ohio State University, Columbus, OH
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 29,   Citation Count: 20
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/566282.566333
What is a DOI?

ABSTRACT

Medial axis as a compact representation of shapes has evolved as an essential geometric structure in a number of applications involving 3D geometric shapes. Since exact computation of the medial axis is difficult in general, efforts continue to approximate them. One line of research considers the point cloud representation of the boundary surface of a solid and then attempts to compute an approximate medial axis from this point sample. It is known that the Voronoi vertices converge to the medial axis for a curve in 2D as the sample density approaches infinity. Unfortunately, the same is not true in 3D. Recently, it is discovered that a subset of Voronoi vertices called poles converge to the medial axis in 3D. However, in practice, a continuous approximation as opposed to a discrete one is sought. Recently few algorithms have been proposed which use the Voronoi diagram and its derivatives to compute this continuous approximation. These algorithms are scale or density dependent. Most of them do not have convergence guarantees, and one of them computes it indirectly from the power diagram of the poles. In this paper we present a new algorithm that approximates the medial axis straight from the Voronoi diagram in a scale and density independent manner with convergence guarantees. The advantage is that, unlike for others, one does not need to fine tune any parameter for this algorithm. We present extensive experimental evidences in support of our claims.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
D. Attali and J.-O. Lachaud. Delaunay conforming iso-surface, skeleton extraction and noise removal. Comput. Geom.: Theory Appl., 2001, to appear
 
3
4
 
5
F. Bernardini and C. L. Bajaj. Sampling and reconstructing manifolds using $alpha$-shapes. it Proc. 9th Canadian Conf. Comput. Geom.,(1997), 193--198
 
6
 
7
 
8
9
10
 
11
 
12
13
14
15
 
16
T. K. Dey, J. Giesen and J. Hudson. Decimating samples for mesh simplification. Proc. 13th Canadian Conf. Comput. Geom. (2001), 85--88
 
17
T. K. Dey and W. Zhao. Approximating medial axis from the Voronoi diagram with convergence guarantee. Manuscript, 2001. http://www.cis.ohio-state.edu/$sim$tamaldey/paper/medial.pdf
 
18
 
19
H. Edelsbrunner, D. G. Kirkpatrick and R. Seidel. On the shape of a set of points in the plane. IEEE Trans. Information Theory, bf 29, (1983), 551--559
20
21
 
22
M. Etzion and A. Rappoport. Computing Voronoi skeletons of a 3D polyhedron by space subdivision. Tech. Report, Hebrew University, 1999
 
23
P. J. Giblin and B. B. Kimia. A formal classification of 3D medial axis points and their local geometry. Proc. Computer Vision and Pattern Recognition (CVPR), 2000
 
24
Geomview tt http://www.geomview.org
 
25
L. Guibas, R. Holleman and L. E. Kavraki. A probabilistic roadmap planner for flexible objects with a workspace medial axis based sampling approach. Proc. IEEE/RSJ Intl. Conf. Intelligent Robots and Systems, 1999
 
26
H. N. Gursoy and N. M. Patrikalakis. Automated interrogation and adaptive subdivision of shape using medial axis transform. Advances in Engineering Software 13 (1991), 287--302
 
27
C. Hoffman. How to construct the skeleton of CSG objects. The Mathematics of Surfaces, IVA, Bowyer and J. Davenport Eds., Oxford Univ. Press, 1990
28
29
 
30
 
31
R. L. Ogniewicz. Skeleton-space: A multiscale shape description combining region and boundary information. Proc. Computer Vision and Pattern Recognition, (1994), 746--751
 
32
 
33
A. Sheffer, M. Etzion, A. Rappoport and M. Bercovier. Hexahedral mesh generation using the embedded Voronoi graph. Engineering Comput. 15 (1999), 248--262
 
34
35
 
36
G. M. Turkiyyah, D. W. Storti, M. Ganter, H. Chen and M. Vimawala. An accelerated triangulation method for computing the skeletons of free-form solid models. Computer Aided Design 29 (1997), 5--19
37
 
38
F.-E. Wolter. Cut locus & medial axis in global shape interrogation & representation. MIT Design Laboratory Memorandum 92--2, 1992
 
39
www.cgal.org
 
40
www.cis.ohio-state.edu/~tamaldey/cocone.html

CITED BY  20

Collaborative Colleagues:
Tamal K. Dey: colleagues
Wulue Zhao: colleagues