Perfect binary space partitions
From MaRDI portal
Recommendations
- Perfect partitions
- Optimal binary space partitions in the plane
- Binary Space Partitions of Orthogonal Subdivisions
- Binary space partitions of orthogonal subdivisions
- Binary space partitions: recent developments
- scientific article; zbMATH DE number 2154100
- scientific article; zbMATH DE number 13178
- Binary partitions revisited
- scientific article; zbMATH DE number 761278
- On perfect binary arrays
Cites work
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Better lower bounds on detecting affine and spherical degeneracies
- Computing and Verifying Depth Orders
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Maintenance of configurations in the plane
- On a class of \(O(n^ 2)\) problems in computational geometry
- Optimal binary space partitions for orthogonal objects
- Visibility of disjoint polygons
Cited in
(5)- On the optimal binary plane partition for sets of isothetic rectangles
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- On optimal cuts of hyperrectangles
- Optimal binary space partitions for segments in the plane
- scientific article; zbMATH DE number 2154100 (Why is no real title available?)
This page was built for publication: Perfect binary space partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676587)