L-infinity interdistance selection by parametric search

DOI10.1016/0020-0190(89)90166-XzbMath0664.68063MaRDI QIDQ1115620

Jeffrey S. Salowe

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational geometrygeometric selectionmultidimensional interdistance selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (6)

A simple algorithm for enumerating longest distances in the plane ⋮ Enclosing \(k\) points in the smallest axis parallel rectangle ⋮ Algorithms for proximity problems in higher dimensions ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ Approximating Distance Measures for the Skyline

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Time bounds for selection
• New Data Structures for Orthogonal Range Queries
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• Parallelism in Comparison Problems
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: L-infinity interdistance selection by parametric search