A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract)

@inproceedings{Mata1997ANA,
  title={A New Algorithm for Computing Shortest Paths in Weighted Planar Subdivisions (Extended Abstract)},
  author={Cristian S. Mata and Joseph S. B. Mitchell},
  booktitle={Symposium on Computational Geometry},
  year={1997}
}
We present a practical new algorithm for the problem of computing low-cost paths in a weighted planar subdivision or on a weighted polyhedral surface. The algorithm is baaed on constructing a relatively sparse graph, a “pathnet”, that links selected pairs of subdivision vertices (and “critical points of entry”) with locally optimal paths. The pathnet can be searched for pat hs that are provably close to optimal and approach optimal, as one varies the parameter that controls the sparsity of the… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 94 citations. REVIEW CITATIONS

9 Figures & Tables

Topics

Statistics

051015'99'01'03'05'07'09'11'13'15'17
Citations per Year

95 Citations

Semantic Scholar estimates that this publication has 95 citations based on the available data.

See our FAQ for additional information.