Farthest-Point Queries with Geometric and Combinatorial Constraints

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(n log n) 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.

[1]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[2]  Ovidiu Daescu,et al.  Polygonal Path Approximation: A Query Based Approach , 2003, ISAAC.

[3]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[6]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[7]  Bidyut Baran Chaudhuri,et al.  Efficiently computing the closest point to a query line , 1998, Pattern Recognit. Lett..

[8]  Richard Cole,et al.  Geometric retrieval problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[10]  Pankaj K. Agarwal,et al.  Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions , 1991, Comput. Geom..

[11]  Pankaj K. Agarwal,et al.  Efficient Algorithms for Approximating Polygonal Chains , 2000, Discret. Comput. Geom..

[12]  Alok Aggarwal,et al.  A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon , 1989, Inf. Process. Lett..

[13]  Chan-Su Shin,et al.  Computing farthest neighbors on a convex polytope , 2003, Theor. Comput. Sci..

[14]  Asish Mukhopadhyay.  Using simplicial partitions to determine a closest point to a query line , 2003, Pattern Recognit. Lett..

[15]  Sergey Bereg,et al.  Queries with segments in Voronoi diagrams , 1999, SODA '99.

[16]  Ovidiu Daescu,et al.  Polygonal chain approximation: a query based approach , 2005, Comput. Geom..

[17]  W. S. Chan,et al.  Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error , 1996, Int. J. Comput. Geom. Appl..

[18]  Ovidiu Daescu,et al.  Space-Efficient Algorithms for Approximating Polygonal Curves in Two-Dimensional Space , 2003, Int. J. Comput. Geom. Appl..

[19]  Alexander Wolff,et al.  Farthest-point queries with geometric and combinatorial constraints , 2004, Comput. Geom..

[20]  Sergei Bespamyatnikh.  Computing closest points for segments. , 2002 .

[21]  Joseph S. B. Mitchell,et al.  Computational Geometry Column 42 , 2001, Int. J. Comput. Geom. Appl..

[22]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[23]  John Hershberger,et al.  Polygonal path approximation with angle constraints , 2001, SODA '01.

[24]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.