Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time

DOI10.1007/978-3-031-19897-7_30MaRDI QIDQ6103065zbMATH OpenOpenAlexFDO

Authors Isabelle Sivignon

Publication date 2 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-19897-7_30

zbMATH Keywords

arborescencecoveringdigital objectoptimal algorithmunion of balls

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Construction of sandwich cover of digital objects
• Triangular covers of a digital object
• Real Polygonal Covers of Digital Discs – Some Theories and Experiments
• scientific article; zbMATH DE number 988752
• The union of balls and its dual shape

Cites work

• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• Explicit linearization of one-dimensional germs through tree-expansions
• Finding a minimum medial axis of a discrete shape is NP-hard
• scientific article; zbMATH DE number 3760888 (Why is no real title available?)
• Introduction to algorithms.
• The computational geometry algorithms library CGAL

This page was built for publication: Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103065)