Farthest-point queries with geometric and combinatorial constraints

O. Daescu, N. Mi, C.S. Shin, A. Wolff

    Research output: Contribution to journalArticleAcademicpeer-review

    13 Citations (Scopus)

    Abstract

    In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log2n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.
    Original languageEnglish
    Pages (from-to)174-185
    JournalComputational Geometry
    Volume33
    Issue number3
    DOIs
    Publication statusPublished - 2006

    Fingerprint

    Dive into the research topics of 'Farthest-point queries with geometric and combinatorial constraints'. Together they form a unique fingerprint.

    Cite this