Skip to main navigation Skip to search Skip to main content

The weighted region problem

  • Stanford University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

We present an algorithm for determining the shortest path between a source and a destination through aplanar subdivision in which each region has an associated weight. Distances are measured according to aweighted Euclidean metric: Each region of the subdivision has associated with it a weight, and the weighteddistance between two points in a convex region is the product of the corresponding weight and the Euclideandistance between them. Our algorithm runs in time 0(n7L) and requires 0(n3) space, wheren is the number of edges of the subdivision, and L is the precision of the problem instance (including thenumber of bits in a user-specified tolerance e, which is the percentage the solution is allowed to differ froman optimal solution). The algorithm uses the fact that shortest paths obey Snell's Law of Refraction at regionboundaries, a local optimality property of shortest paths that is well-known from the analogous optics model.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987
EditorsD. Soule
PublisherAssociation for Computing Machinery, Inc
Pages30-38
Number of pages9
ISBN (Electronic)0897912314, 9780897912310
DOIs
StatePublished - Oct 1 1987
Event3rd Annual Symposium on Computational Geometry, SCG 1987 - Waterloo, Canada
Duration: Jun 8 1987Jun 10 1987

Publication series

NameProceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987

Conference

Conference3rd Annual Symposium on Computational Geometry, SCG 1987
Country/TerritoryCanada
CityWaterloo
Period06/8/8706/10/87

Fingerprint

Dive into the research topics of 'The weighted region problem'. Together they form a unique fingerprint.

Cite this