On some geometric selection and optimization problems via sorted matrices

Alex Glozman, Klara Kedem, Gregory Shpitalnik

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

In this paper we apply the selection and optimization technique of Frederickson and Johnson to a number of geometric selection and optimization problems, some of which have previously been solved by parametric search, and provide efficient and simple algorithms. Our technique improves the solutions obtained by parametric search by a log n factor. For example, we apply the technique to the two-line center problem, where we want to find two strips that cover a given set S of n points in the plane, so as to minimize the width of the largest of the two strips.

Original languageEnglish
Pages (from-to)17-28
Number of pages12
JournalComputational Geometry: Theory and Applications
Volume11
Issue number1
DOIs
StatePublished - 1 Jan 1998

Keywords

  • Algorithm
  • Computational geometry
  • Optimization
  • Selection
  • Two-line center

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'On some geometric selection and optimization problems via sorted matrices'. Together they form a unique fingerprint.

Cite this