Approximate medial axis as a voronoi subcomplex

  • Authors:
  • Tamal K. Dey;Wulue Zhao

  • Affiliations:
  • Ohio State University, Columbus, OH;Ohio State University, Columbus, OH

  • Venue:
  • Proceedings of the seventh ACM symposium on Solid modeling and applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.