Algorithms for minimum length partitions of polygons

DOI10.1007/BF01937272MaRDI QIDQ1102107zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

computational complexityVLSIsimple polygongeometric partition

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 3883609
• Minimum k-partitioning of rectilinear polygons
• scientific article; zbMATH DE number 4062592
• Computing optimal diameter-bounded polygon partitions
• On partitioning rectilinear polygons into star-shaped polygons

Cites work

• Minimal Triangulations of Polygonal Domains
• Optimal Alphabetic Trees
• Optimal Multi-Way Search Trees
• The greedy and Delaunay triangulations are not bad in the average case
• Visibility of a simple polygon

Cited in

(10)

• scientific article; zbMATH DE number 1629819 (Why is no real title available?)
• Computing optimal diameter-bounded polygon partitions
• scientific article; zbMATH DE number 3883609 (Why is no real title available?)
• An equivalence diagram of star partitioning and simple polygons generation
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• 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

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)