Optimal Binary Space Partitions in the Plane

DOI10.1007/978-3-642-14031-0_25zbMath1286.68471OpenAlexW1553182599MaRDI QIDQ3578320

Amirali Khosravi, Mark T. 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

1-extendability of independent sets ⋮ On the minimum eccentricity shortest path problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Complexity of Total Vertex Cover on Subcubic Graphs ⋮ On the geometric red-blue set cover problem ⋮ 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 ⋮ 1-extendability of independent sets ⋮ An algorithmic study of switch graphs ⋮ The partial visibility representation extension problem ⋮ Range assignment of base-stations maximizing coverage area without interference ⋮ Generalizing Geometric Graphs ⋮ Augmenting Geometric Graphs with Matchings

This page was built for publication: Optimal Binary Space Partitions in the Plane