Algorithms for minimum length partitions of polygons
DOI10.1007/BF01937272zbMATH Open0643.68047DBLPjournals/bit/LingasLS87OpenAlexW1966745172WikidataQ62037529 ScholiaQ62037529MaRDI QIDQ1102107FDOQ1102107
Authors: Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937272
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Cites Work
Cited In (10)
- Title not available (Why is that?)
- Computing optimal diameter-bounded polygon partitions
- An equivalence diagram of star partitioning and simple polygons generation
- Title not available (Why is that?)
- Tight Time Bounds for the Minimum Local Convex Partition Problem
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Minimum k-partitioning of rectilinear polygons
- Computing the longest diagonal of a simple polygon
- Approximation algorithms for partitioning a rectangle with interior points
- Title not available (Why is that?)
This page was built for publication: Algorithms for minimum length partitions of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102107)