On some geometric selection and optimization problems via sorted matrices

DOI10.1016/S0925-7721(98)00017-0zbMath0904.68176OpenAlexW2092477607MaRDI QIDQ1265327

Gregory Shpitalnik, Alex Glozman, Klara Kedem

Publication date: 28 September 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00017-0

zbMATH Keywords

optimizationgeometric selection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Improved algorithms for placing undesirable facilities ⋮ Continuous location of dimensional structures. ⋮ Covering a set of points in a plane using two parallel rectangles ⋮ Minimum-width double-strip and parallelogram annulus

Cites Work

• L-infinity interdistance selection by parametric search
• Maintenance of configurations in the plane
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Getting around a lower bound for the minimum Hausdorff distance
• Time bounds for selection
• Generalized Selection and Ranking: Sorted Matrices
• Finding tailored partitions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Finding kth paths and p-centers by generating and searching good data structures
• The two-line center problem from a polar view: a new algorithm and data structure
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some geometric selection and optimization problems via sorted matrices