AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS

DOI10.1142/S0218195996000186zbMath0859.68040MaRDI QIDQ5687649

Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld

Publication date: 31 March 1997

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

geometric optimization problemsweak separation problem for sets

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (15)

An efficient \(k\) nearest neighbors searching algorithm for a query line. ⋮ Separability of imprecise points ⋮ Computing a minimum-width square or rectangular annulus with outliers ⋮ Bottleneck bichromatic full Steiner trees ⋮ Plane bichromatic trees of low degree ⋮ Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Relative \((p,\varepsilon )\)-approximations in geometry ⋮ Planar Bichromatic Bottleneck Spanning Trees ⋮ Outlier respecting points approximation ⋮ Data imprecision under \(\lambda\)-geometry model ⋮ Algorithms for Radon partitions with tolerance ⋮ Computing a Minimum-Width Square or Rectangular Annulus with Outliers ⋮ Planar bichromatic minimum spanning trees ⋮ The maximum-level vertex in an arrangement of lines

This page was built for publication: AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS