ACM Home Page
Please provide us with feedback. Feedback
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
Full text PdfPdf (526 KB)
Source
Annual Symposium on Computational Geometry archive
Proceedings of the twenty-third annual symposium on Computational geometry table of contents
Gyeongju, South Korea
SESSION: Session 4A: video session table of contents
Pages: 123 - 124  
Year of Publication: 2007
ISBN:978-1-59593-705-6
Authors
Balint Miklos  ETH, Zürich, Switzerland
Joachim Giesen  Max-Planck Institut für Informatik, Saarbrücken, Germany
Mark Pauly  ETH, Zürich, Switzerland
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general approximation method that builds on the same idea, namely, to approximate the shape by a union of balls. While not as general, our algorithm is simpler, faster and numerically more stable. Both algorithms are visualized using the Mesecina tool, which is also described.




Collaborative Colleagues:
Balint Miklos: colleagues
Joachim Giesen: colleagues
Mark Pauly: colleagues