Computing Many Faces in Arrangements of Lines and Segments
From MaRDI portal
Publication:4388883
DOI10.1137/S009753979426616XzbMath0907.68088OpenAlexW1965146563WikidataQ56442896 ScholiaQ56442896MaRDI QIDQ4388883
Otfried Schwarzkopf, Pankaj K. Agarwal, Ji{ří} Matoušek
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979426616x
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (7)
From proximity to utility: a Voronoi partition of Pareto optima ⋮ A note on visibility-constrained Voronoi diagrams ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ On separating points by lines ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions
This page was built for publication: Computing Many Faces in Arrangements of Lines and Segments