Computing closest and farthest points for a query segment

Michael Segal, Eli Zeitlin

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper we present an improved algorithm for finding k closest (farthest) points for a given arbitrary query segment. We show how to preprocess a planar set P of n given points in O (n2 log n) expected time (or, alternatively, in O (n2 log2 n) deterministic time) and a subquadratic space, in order to report k closest points to an arbitrary given query line segment in O (k + log2 n log log n) time. Here, for the first time, the data structure that provides polylogarithmic query time and uses subquadratic space is presented. We also show an algorithm for reporting the k farthest points from an arbitrary given query line segment.

Original languageEnglish
Pages (from-to)294-300
Number of pages7
JournalTheoretical Computer Science
Volume393
Issue number1-3
DOIs
StatePublished - 20 Mar 2008

Keywords

  • Computational geometry
  • Data structure
  • Segment dragging problem

Fingerprint

Dive into the research topics of 'Computing closest and farthest points for a query segment'. Together they form a unique fingerprint.

Cite this