Finding a Minimum Medial Axis of a Discrete Shape is NP-hard - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2008

Finding a Minimum Medial Axis of a Discrete Shape is NP-hard

(1) , (2) , (1)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
TCS_MinMedialAxisNP.pdf (6.56 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00332406 , version 1 (20-10-2008)

Identifiers

  • HAL Id : hal-00332406 , version 1

Cite

David Coeurjolly, Jérôme Hulin, Isabelle Sivignon. Finding a Minimum Medial Axis of a Discrete Shape is NP-hard. Theoretical Computer Science, 2008, 206 (1-2), pp.72-79. ⟨hal-00332406⟩
162 View
97 Download

Share

Gmail Facebook Twitter LinkedIn More