On the All-Pairs Euclidean Short Path Problem

@inproceedings{Chen1995OnTA,
  title={On the All-Pairs Euclidean Short Path Problem},
  author={Danny Ziyi Chen},
  booktitle={SODA},
  year={1995}
}
Given a set of polygonal obstacles of n vertices in the plane’, the problem of processing the all-pairs Euclidean short path queries is that of reporting an obstacle-avoiding path P (or its length) between two arbitrary query points p and q in the plane, such that the length of P is within a small factor of the length of a Euclidean shortest obstacle-avoiding path between p and q. The goal is to answer each short path query quickly by constructing data structures that capture path information… CONTINUE READING

Similar Papers

Loading similar papers…