Optimal binary space partitions for segments in the plane
From MaRDI portal
Recommendations
Cites work
- A note on binary plane partitions
- Binary plane partitions for disjoint line segments
- Efficient binary space partitions for hidden-surface removal and solid modeling
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Linear size binary space partitions for uncluttered scenes
- On optimal cuts of hyperrectangles
- On the optimal binary plane partition for sets of isothetic rectangles
- Optimal binary space partitions for orthogonal objects
- Optimal BSPs and rectilinear cartograms
- Perfect binary space partitions
- Planar Formulae and Their Uses
- The Problem of Compatible Representatives
Cited in
(66)- A note on binary plane partitions
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
- Upward planar drawings with three and more slopes
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Complexity of domination in triangulated plane graphs
- On compatible triangulations with a minimum number of Steiner points
- Extending simple drawings
- On simplified NP-complete variants of \textsc{Monotone 3-Sat}
- On the geometric red-blue set cover problem
- Dispersing and grouping points on planar segments
- Minimum weight connectivity augmentation for planar straight-line graphs
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- \((k,p)\)-planarity: a relaxation of hybrid planarity
- Recognizing DAGs with page-number 2 is NP-complete
- Snapping graph drawings to the grid optimally
- Minimum weight connectivity augmentation for planar straight-line graphs
- Reconstruction of Weakly Simple Polygons from Their Edges
- Optimal binary space partitions in the plane
- Optimal binary space partitions for orthogonal objects
- Binary Space Partitions for Line Segments with a Limited Number of Directions
- Independent dominating set problem revisited
- scientific article; zbMATH DE number 2115904 (Why is no real title available?)
- scientific article; zbMATH DE number 2119698 (Why is no real title available?)
- On the proper orientation number of bipartite graphs
- Optimal sectionalization of a trellis
- The Monotone Satisfiability Problem with Bounded Variable Appearances
- Approximating dominating set on intersection graphs of rectangles and L-frames
- Maximum area axis-aligned square packings
- Extending Partial Orthogonal Drawings
- Extending partial orthogonal drawings
- Planar 3-SAT with a clause/variable cycle
- Drawing clustered planar graphs on disk arrangements
- A note on binary plane partitions
- Multilevel planarity
- Upward Planar Drawings with Three and More Slopes
- Particle-based assembly using precise global control
- Complexity of fall coloring for restricted graph classes
- On the minimum consistent subset problem
- Level-planar drawings with few slopes
- Particle-based assembly using precise global control
- The dispersive art gallery problem
- Exact algorithms and hardness results for geometric red-blue hitting set problem
- Unit-length rectangular drawings of graphs
- Recognizing DAGs with page-number 2 is NP-complete
- Guarding polyominoes under \(k\)-hop visibility
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- On layered area-proportional rectangle contact representations
- Unit-length rectangular drawings of graphs
- On layered area-proportional rectangle contact representations
- Computing conforming partitions with low stabbing number for rectilinear polygons
- Tractable graph structures in EFX orientation
- From planar via outerplanar to outerpath -- engineering NP-hardness constructions (poster abstract)
- On k-plane insertion into plane drawings
- On two-handed planar assembly partitioning with connectivity constraints
- On some geometric optimization problems with segments
- Multipacking in the Euclidean metric space
- NP-completeness and physical zero-knowledge proof of Hotaru Beam
- Partial and constrained level planarity
- Computing conforming partitions with low stabbing number for rectilinear polygons
- Guarding polyominoes under k-hop visibility
- On the geometric red-blue set cover problem
- Tight approximation and kernelization bounds for vertex-disjoint shortest paths
- Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
- Sliding squares in parallel
- Regular augmentation of planar graphs
This page was built for publication: Optimal binary space partitions for segments in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299997)
