Minimum convex partition of a polygon with holes by cuts in given directions

DOI10.1007/s002240000101zbMath0910.68221OpenAlexW2756687316MaRDI QIDQ1271271

Andrzej Lingas, Valeriu Soltan

Publication date: 11 November 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000101

zbMATH Keywords

minimum convex partition

Mathematics Subject Classification ID

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

Related Items (3)

GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY ⋮ Approximation algorithms for decomposing octilinear polygons ⋮ On convex partitions of polygonal regions

This page was built for publication: Minimum convex partition of a polygon with holes by cuts in given directions