Selecting distances in arrangements of hyperplanes spanned by points.

DOI10.1016/j.jda.2003.12.001zbMath1108.68060OpenAlexW1983660885MaRDI QIDQ878011

Sergei Bespamyatnikh, Michael Segal

Publication date: 25 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2003.12.001

zbMATH Keywords

CountingParametric searchLower boundDistance selection problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (2)

All-maximum and all-minimum problems under some measures ⋮ Proximity problems on line segments spanned by points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal slope selection via expanders
• Sorting in \(c \log n\) parallel steps
• Randomized optimal algorithm for slope selection
• Computing the smallest \(k\)-enclosing circle and related problems
• Optimal slope selection via cuttings
• On a class of \(O(n^ 2)\) problems in computational geometry
• Selecting distances in the plane
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• An Optimal-Time Algorithm for Slope Selection
• Slowing down sorting networks to obtain faster sorting algorithms
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
• A RANDOMIZED ALGORITHM FOR SLOPE SELECTION

This page was built for publication: Selecting distances in arrangements of hyperplanes spanned by points.