Algorithms for minimum length partitions of polygons
From MaRDI portal
Publication:1102107
DOI10.1007/BF01937272zbMath0643.68047WikidataQ62037529 ScholiaQ62037529MaRDI QIDQ1102107
Jörg-Rüdiger Sack, Andrzej Lingas, Christos Levcopoulos
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
05B40: Combinatorial aspects of packing and covering
68R99: Discrete mathematics in relation to computer science
Related Items
Cites Work