Link distance and shortest path problems in the plane

A.F. Cook IV; C. Wenk

doi:10.1007/978-3-642-02158-9_13

Link distance and shortest path problems in the plane

A.F. Cook IV
, C. Wenk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

Abstract

We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.

Original language	English
Title of host publication	Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings
Editors	A.V. Goldberg, Y. Zhou
Place of Publication	Berlin
Publisher	Springer
Pages	141-151
ISBN (Print)	978-3-642-02157-2
DOIs	https://doi.org/10.1007/978-3-642-02158-9_13
Publication status	Published - 2009

Publication series

Name	Lecture Notes in Computer Science
Volume	5564
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-02158-9_13

Cite this

Cook IV, A. F., & Wenk, C. (2009). Link distance and shortest path problems in the plane. In A. V. Goldberg, & Y. Zhou (Eds.), Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings (pp. 141-151). (Lecture Notes in Computer Science; Vol. 5564). Springer. https://doi.org/10.1007/978-3-642-02158-9_13

@inproceedings{2b9a19c27a254dcdbf637dcc0012f382,

title = "Link distance and shortest path problems in the plane",

abstract = "We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr{\'e}chet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.",

author = "\{Cook IV\}, A.F. and C. Wenk",

year = "2009",

doi = "10.1007/978-3-642-02158-9\_13",

language = "English",

isbn = "978-3-642-02157-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "141--151",

editor = "A.V. Goldberg and Y. Zhou",

booktitle = "Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings",

address = "Germany",

}

Cook IV, AF & Wenk, C 2009, Link distance and shortest path problems in the plane. in AV Goldberg & Y Zhou (eds), Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings. Lecture Notes in Computer Science, vol. 5564, Springer, Berlin, pp. 141-151. https://doi.org/10.1007/978-3-642-02158-9_13

Link distance and shortest path problems in the plane. / Cook IV, A.F.; Wenk, C.
Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings. ed. / A.V. Goldberg; Y. Zhou. Berlin: Springer, 2009. p. 141-151 (Lecture Notes in Computer Science; Vol. 5564).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Link distance and shortest path problems in the plane

AU - Cook IV, A.F.

AU - Wenk, C.

PY - 2009

Y1 - 2009

N2 - We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.

AB - We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.

U2 - 10.1007/978-3-642-02158-9_13

DO - 10.1007/978-3-642-02158-9_13

M3 - Conference contribution

SN - 978-3-642-02157-2

T3 - Lecture Notes in Computer Science

SP - 141

EP - 151

BT - Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings

A2 - Goldberg, A.V.

A2 - Zhou, Y.

PB - Springer

CY - Berlin

ER -

Cook IV AF, Wenk C. Link distance and shortest path problems in the plane. In Goldberg AV, Zhou Y, editors, Algorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings. Berlin: Springer. 2009. p. 141-151. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-02158-9_13

Link distance and shortest path problems in the plane

Abstract

Publication series

Access to Document

Fingerprint

Cite this