Farthest-point queries with geometric and combinatorial constraints

@article{Daescu2006FarthestpointQW,
  title={Farthest-point queries with geometric and combinatorial constraints},
  author={Ovidiu Daescu and Ningfang Mi and Chan-Su Shin and Alexander Wolff},
  journal={Comput. Geom.},
  year={2006},
  volume={33},
  pages={174-185}
}
In this paper we discuss farthest-point problems, in which a sequence S = (p1, p2, . . . , pn) of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. We first consider the general setting where query points can be arbitrary, then we investigate a special setting where each point in S is queried exactly once. To describe our problems, we use the following notation. Given two points p 6= q, let pq denote the line through the points p and q, let… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Farthest - point queries with geometric and combinatorial constraints

  • Ningfang Mi, Chan-Su Shin
  • Computational Geometry : Theory and Applications
  • 2005

Computing closest points for segments

  • J. Snoeyink
  • Int . J . Comput . Geom . Appl .
  • 2003

Varadarajan , Efficient algorithms for approximating polygonal chains , Discrete Comput

  • K. R. P. K. Agarwal
  • Geom .
  • 2000

Similar Papers

Loading similar papers…