Algorithms for minimum length partitions of polygons
From MaRDI portal
Publication:1102107
DOI10.1007/BF01937272zbMath0643.68047OpenAlexW1966745172WikidataQ62037529 ScholiaQ62037529MaRDI QIDQ1102107
Jörg-Rüdiger Sack, Andrzej Lingas, Christos Levcopoulos
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937272
Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items
Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ Minimum k-partitioning of rectilinear polygons
Cites Work