scientific article; zbMATH DE number 3784283

MaRDI QIDQ3962480zbMATH OpenFDO

Authors Andrzej Lingas

Publication date 1982

zbMATH Keywords

approximationcomputational geometryNP-hardnessrectangular partitionrectilinear polygon with holesweighted matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(6)

• Improved bounds for rectangular and guillotine partitions
• Approximation algorithms for partitioning a rectangle with interior points
• On optimal guillotine partitions approximating optimal \(d\)-box partitions
• Computing conforming partitions of orthogonal polygons with minimum stabbing number
• Rectangular partitions of a rectilinear polygon
• Linear-time heuristics for minimum weight rectangulation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962480)