scientific article
From MaRDI portal
Publication:3786288
zbMATH Open0643.90070MaRDI QIDQ3786288FDOQ3786288
Publication date: 1986
Title of this publication is not available (Why is that?)
Cited In (15)
- Storing line segments in partition trees
- Title not available (Why is that?)
- Computational Science and Its Applications β ICCSA 2004
- The structure of optimal partitions of orthogonal polygons into fat rectangles
- Title not available (Why is that?)
- Partitioning and separating sets of orthogonal polygons
- On \(d\)-convex partitions of polygonal regions
- Minimum k-partitioning of rectilinear polygons
- Title not available (Why is that?)
- Partitioning linear spaces into complete quadrilaterals and \(n\)-gons
- Linear-time heuristics for minimum weight rectangulation
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- On partitioning rectilinear polygons into star-shaped polygons
- Rectangular partition is polynomial in two dimensions but NP-complete in three
- Approximation algorithms for partitioning a rectangle with interior points
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number π π
- On a partition into convex polygons π π
- Partitioning and separating sets of orthogonal polygons π π
- On partitioning rectilinear polygons into star-shaped polygons π π
- On \(d\)-convex partitions of polygonal regions π π
- Minimum k-partitioning of rectilinear polygons π π
- On convex partitions of polygonal regions π π
- Rectangular partitions of a rectilinear polygon π π
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 Q3786288)