4.5 Article

IMAT: The Iterative Medial Axis Transform

Journal

COMPUTER GRAPHICS FORUM
Volume 40, Issue 6, Pages 162-181

Publisher

WILEY
DOI: 10.1111/cgf.14266

Keywords

Medial Axis Transform; Surface Reconstruction; Geometric Modeling

Funding

  1. Biomimetic Robotics Research Center under ADD Acquisition Program [UD190018ID]
  2. NRF [2016RA5A1938472]
  3. MOTIE ATC+ Technology Innovation Program [20008547]
  4. SNU BK21+ Program in Mechanical Enginering
  5. SNU-IAMD
  6. SNU Institute for Engineering Research
  7. National Research Foundation of Korea (NRF) - Korean government (MSIT) [2020R1C1C1008195]
  8. National Research Foundation of Korea [2020R1C1C1008195] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

IMAT is an iterative descent method for constructing a MAT from a sparse, noisy, oriented point cloud sampled from an object's boundary. The algorithm minimizes an error function reflecting the difference between the boundaries while restricting the number of balls. Analysis of diverse 2D and 3D objects demonstrates the noise robustness, shape fidelity, and representation efficiency of the resulting MAT.
We present the iterative medial axis transform (IMAT), an iterative descent method that constructs a medial axis transform (MAT) for a sparse, noisy, oriented point cloud sampled from an object's boundary. We first establish the equivalence between the traditional definition of the MAT of an object, i.e., the set of centres and corresponding radii of all balls maximally inscribed inside the object, with an alternative characterization matching the boundary enclosing the union of the balls with the object boundary. Based on this boundary equivalence characterization, a new MAT algorithm is proposed, in which an error function that reflects the difference between the two boundaries is minimized while restricting the number of balls to within some a priori specified upper limit. An iterative descent method with guaranteed local convergence is developed for the minimization that is also amenable to parallelization. Both quantitative and qualitative analyses of diverse 2D and 3D objects demonstrate the noise robustness, shape fidelity, and representation efficiency of the resulting MAT.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available