Finding a minimum medial axis of a discrete shape is NP-hard
type: Item
instance of: scholarly article
title: Finding a minimum medial axis of a discrete shape is NP-hard
zbMATH Open document ID: 1160.68040
author: David Coeurjolly
author: Jérôme Hulin
author: Isabelle Sivignon
published in: Theoretical Computer Science
publication date: 2008-11-12T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5365100
zbMATH Keywords: minimum medial axis
zbMATH Keywords: NP-completeness
zbMATH Keywords: bounded approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.06.013
OpenAlex ID: W2028302408
cites work: Q3619797
cites work: Q4348479
cites work: A unified linear-time algorithm for computing distance maps
cites work: The minimum broadcast time problem for several processor networks
cites work: Medial axis for chamfer distances: computing look-up tables and neighbourhoods in 2D or 3D
cites work: Sequential Operations in Digital Picture Processing
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
DOI: 10.1016/J.TCS.2008.06.013
description: scientific article; zbMATH DE number 5365100