The power of geometric duality
From MaRDI portal
Publication:1082821
DOI10.1007/BF01934990zbMath0603.68072WikidataQ55954534 ScholiaQ55954534MaRDI QIDQ1082821
Publication date: 1985
Published in: BIT (Search for Journal in Brave)
computational geometry; computation of line arrangements; half-plane range query problem; minimum-area triangle
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Bounding the number of \(k\)-faces in arrangements of hyperplanes, On \(k\)-sets in arrangements of curves and surfaces, Arrangements of curves in the plane --- topology, combinatorics, and algorithms, Reporting points in halfspaces, Efficient partition trees, Constructing arrangements optimally in parallel, Covering grids and orthogonal polygons with periscope guards