Optimal binary space partitions in the plane
From MaRDI portal
Publication:3578320
DOI10.1007/978-3-642-14031-0_25zbMATH Open1286.68471OpenAlexW1553182599MaRDI QIDQ3578320FDOQ3578320
Authors: Amirali Khosravi, Mark de Berg 
Publication date: 20 July 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_25
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (19)
- Minimizing corners in colored rectilinear grids
- 1-extendability of independent sets
- On the geometric red-blue set cover problem
- Title not available (Why is that?)
- On the minimum eccentricity shortest path problem
- On complexity of total vertex cover on subcubic graphs
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
- Computing realistic terrains from imprecise elevations
- On the optimal binary plane partition for sets of isothetic rectangles
- 1-extendability of independent sets
- Title not available (Why is that?)
- Range assignment of base-stations maximizing coverage area without interference
- Augmenting Geometric Graphs with Matchings
- Optimal binary space partitions for orthogonal objects
- Optimal binary space partitions for segments in the plane
- An algorithmic study of switch graphs
- Perfect binary space partitions
- Generalizing geometric graphs
This page was built for publication: Optimal binary space partitions in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578320)
