Finding a minimum medial axis of a discrete shape is NP-hard

David Coeurjolly, Jérôme Hulin, Isabelle Sivignon
2008 Theoretical Computer Science  
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algorithms which compute an approximation of the minimum medial axis, one of them providing bounded approximation results.
doi:10.1016/j.tcs.2008.06.013 fatcat:5elzyd4uqvgzdlidhqnmhidn3m