Higher Order City Voronoi Diagrams

Andreas Gemsa1 , D.T. Lee2,3 , Chih-Hung Liu1,2 , Dorothea Wagner1

1 Karlsruhe Institute of Technology (KIT), 2 Academia Sinica, 3 National Chung Hsing University.

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order City Voronoi Diagrams

Q: Higher Order Voronoi Diagrams?

Q: City Voronoi Diagrams?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane
Structural Complexity
first-order O(n)

k th -order O(k(n − k))

farthest-site O(n)

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane
Structural Complexity
first-order O(n)

k th -order O(k(n − k))

farthest-site O(n)

Time Complexity
first-order O(n log n)

k th -order O(k2 n log n)

farthest-site O(n log n)

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

[first order] Voronoi diagram V1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

second order Voronoi diagram V2 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

second order Voronoi diagram V2 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

second order Voronoi diagram V2 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

second order Voronoi diagram V2 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

second order Voronoi diagram V2 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

k -th order Voronoi diagram Vk (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane
Structural Complexity
first-order O(n)

k th -order O(k(n − k))

farthest-site O(n)

Time Complexity
first-order O(n log n)

k th -order O(k2 n log n)

farthest-site O(n log n)

k -th order Voronoi diagram Vk (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

(n − 1)-th order Voronoi diagram Vn−1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

(n − 1)-th order Voronoi diagram Vn−1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

(n − 1)-th order Voronoi diagram Vn−1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane

(n − 1)-th order Voronoi diagram Vn−1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order Voronoi Diagrams
Given: Set S of n points in the plane
Structural Complexity
first-order O(n)

k th -order O(k(n − k))

farthest-site O(n)

Time Complexity
first-order O(n log n)

k th -order O(k2 n log n)

farthest-site O(n log n)

(n − 1)-th order Voronoi diagram Vn−1 (S)

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order City Voronoi Diagrams

Q: Higher Order Voronoi Diagrams?

Q: City Voronoi Diagrams?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

quickest path?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

quickest path?
walk

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

quickest path?
walk

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

quickest path?
walk

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk

quickest path?
walk

walk

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk
L1 metric
quickest path?
walk

walk
city metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric

shortest path:
walk
L1 metric
quickest path?
walk

walk
city metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

shortest path:
walk
L1 metric
quickest path?
walk

walk
city metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

Def.: transportation network

graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
speed off the network: 1
speed on the network: v > 1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
speed off the network: 1
speed on the network: v > 1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
speed off the network: 1
speed on the network: v > 1
c := |VC |
Complexity of G: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

q G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
speed off the network: 1
speed on the network: v > 1
c := |VC |
p Complexity of G: O(c)

distance between two points?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

q G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
L1 speed off the network: 1
speed on the network: v > 1
c := |VC |
p Complexity of G: O(c)

distance between two points?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

q G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
L1 speed off the network: 1
speed on the network: v > 1
c := |VC |
p Complexity of G: O(c)

distance between two points?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 City Metric
city metric:
L1 metric and transportation network

q G
Def.: transportation network
graph G = (VC , EC )
planar, straight-line embedding
only horizontal and vertical edges
L1 speed off the network: 1
speed on the network: v > 1
c := |VC |
p Complexity of G: O(c)

dC (p, q) distance between two points?

quickest path
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Higher Order City Voronoi Diagrams

Q: Higher Order Voronoi Diagrams?

Q: City Voronoi Diagrams?

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Our Contribution

Euclidean-Metric City-Metric
Structural Complexity Structural Complexity
first-order Θ(n) first-order Θ(n + c)

k th -order Θ(k(n − k)) k th -order O(k(n − k) + kc)

farthest-site Θ(n) Ω(n + kc)
farthest-site Θ(nc) [Bae et al., 2012]

Time Complexity Time Complexity

first-order O(n log n) first-order O((n + c) log n)

k th -order O(k2 n log n) k th -order O(k2 (n + c) log(n + c))

farthest-site O(n log n) O(nc log n log2 (n + c))
farthest-site [Bae et al., 2012]

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Our Contribution

Euclidean-Metric City-Metric
Structural Complexity Structural Complexity
first-order Θ(n) first-order Θ(n + c)

k th -order Θ(k(n − k)) k th -order O(k(n − k) + kc)

farthest-site Θ(n) Ω(n + kc)
farthest-site Θ(nc) [Bae et al., 2012]

Time Complexity Time Complexity

first-order O(n log n) first-order O((n + c) log n)

k th -order O(k2 n log n) k th -order O(k2 (n + c) log(n + c))

farthest-site O(n log n) O(nc log n log2 (n + c))
farthest-site [Bae et al., 2012]

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – Euclidean Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – L1 Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

O(c) activation points [Aichholzer et al., 2004]

Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p activation point

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p activation point

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

q q0
p

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

r
’quickest path’ from q to r

q q0
p

dC (p, q)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Wavefront Propagation – City Metric

arrow

r
’quickest path’ from q to r

q q0
p

dC (p, q)

Needle: Weighted network segment [Bae et al., 2009]

q q0
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

BC (p, q)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

BC (p, q)

|BC (p, q)| = Θ(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)

|BC (p, q)| = Θ(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

|BC (p, q)| = Θ(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

|BC (p, q)| = Θ(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

r
q

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

r
q

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Shortest Path Map – Example

r
q

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound

BC (p, q)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound

BC (p, q)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound

BC (p, q)

m4
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)

BC (p, q)

m4
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)

m4
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)
Q: Path between mi and mi+1 ?

m4
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)
Q: Path between mi and mi+1 ?
→ L1 bisector between two needles
m4
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)
Q: Path between mi and mi+1 ?
→ L1 bisector between two needles
bisector has complexity O(1) m4
[Bae and Chwa, 2005]
p
m3

m2

q
m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)
Q: Path between mi and mi+1 ?
→ L1 bisector between two needles
bisector has complexity O(1) m4
[Bae and Chwa, 2005]
p
m3

m2
Lemma 1
Voronoi edge e has m mixed q
vertices. m1

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Mixed Vertices in BC (p, q)
intersection of three shortest path regions
BC (p, q)
Q: Path between mi and mi+1 ?
→ L1 bisector between two needles
bisector has complexity O(1) m4
[Bae and Chwa, 2005]
p
m3

m2
Lemma 1
Voronoi edge e has m mixed q
vertices. m1
Then e consists of O(m + 1)
segments.
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Mixed Voronoi Vertices and An Upper Bound
Lemma 2
|Vk (S)| = O(k(n − k) + M ), M = #mixed vertices of Vk (S)
#edges is O(k(n − k)) [Lee, 1982] BC (p, q)
|ei | = O(mi + 1) (Lemma 1)
P
M= mi m4
p
m3

m2
Lemma 1
Voronoi edge e has m mixed q
vertices. m1
Then e consists of O(m + 1)
segments.
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

V1 (S)

q1 q3

q2 p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

V1 (S)

q1 q3

q2 p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) V1 (Q)

q1 q1 q3 q3

q2 q2 p
q4 q4

q6 q6 q5 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) ∩ V1 (Q)

q1 q3

q2 p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

Q = S \ {p}
V1 (S) ∩ V1 (Q)

q1 q3

q2 p
q4

q6 q5

V2 (S)
Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk

Vj+1 (S) can be constructed from Vj (S). [Lee, 1982]

V1 (S) V1 (Q)

q1 q3 q1 q3

q2 p q2
q4 q4

q6 q5 q6 q5
V2 (S)
Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Wavefront
Q: How to transfer this approach to wavefront propagation?
Propagate a wavefront from every qi and not from p

q1
q3

q2
p
q4

q6 q5

Euclidean Metric
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q

BC (p, q)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q

BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

Q: Connection with mixed

vertices?
p

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

Q: Connection with mixed

vertices?
p
#mixed vertices in Vj (S)
≤

q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

Q: Connection with mixed

vertices?
p
#mixed vertices in Vj (S)
≤
#mixed vertices in Vj−1 (S)
q2

q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

Q: Connection with mixed

vertices?
p
#mixed vertices in Vj (S)
≤
#mixed vertices in Vj−1 (S)
+ q2
2#(new wavefronts) by q ∈ S
q1 q
q10

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – City Metric
before: wavefront propagation only from q
now: wavefront propagation from needles
BC (p, q)

Q: Connection with mixed

vertices?
p
#mixed vertices in Vj (S)
≤
#mixed vertices in Vj−1 (S)
+ q2
2#(new wavefronts) by q ∈ S
q1
+ q
complexity of the trans- q10
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound

#mixed vertices in Vj (S)

≤
#mixed vertices in Vj−1 (S)
+
2#(new wavefronts) by q ∈ S
+
complexity of the trans-
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+
2#(new wavefronts) by q ∈ S
+
complexity of the trans-
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+ P
2#(new wavefronts) by q ∈ S #(new wavefronts) = O(n)
+
complexity of the trans-
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+ P
2#(new wavefronts) by q ∈ S #(new wavefronts) = O(n)
+ +
complexity of the trans- P
O(c) = O(kc)
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound
Lemma 2
|Vk (S)| = O(k(n − k) + M ), M = #mixed vertices of Vk (S)

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+ P
2#(new wavefronts) by q ∈ S #(new wavefronts) = O(n)
+ +
complexity of the trans- P
O(c) = O(kc)
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound
Lemma 2
|Vk (S)| = O(k(n − k) + M ), M = #mixed vertices of Vk (S)

Theorem 1
|Vk (S)| = O(k(n − k) + kc)

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+ P
2#(new wavefronts) by q ∈ S #(new wavefronts) = O(n)
+ +
complexity of the trans- P
O(c) = O(kc)
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Upper Bound
Lemma 2
|Vk (S)| = O(k(n − k) + M ), M = #mixed vertices of Vk (S)

Theorem 1
|Vk (S)| = O(k(n − k) + kc)

#mixed vertices in Vj (S) #mixed vertices in Vk (S)

≤ =
#mixed vertices in Vj−1 (S)
+ P
2#(new wavefronts) by q ∈ S #(new wavefronts) = O(n)
+ +
complexity of the trans- P
O(c) = O(kc)
portation network: O(c)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Structural Complexity – Overview

Shortest Path Map (SPM)

BC (p, q)
Mixed Vertices
# of mixed vertices
p

structural complexity of Vk (S)

Wavefront Propagation
Iterative Construction of Vk (S)

# of mixed vertices
q

|BC (p, q)| = Θ(c)

structural complexity of Vk (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S)

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S) (Vj+1 (S) from Vj (S))
From Vj to Vj+1 :
q1
q3
q2 p
q4
q6 q5

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S)
From Vj to Vj+1 :
p

q2
q1
q10 q

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S)
From Vj to Vj+1 :
p
For every Voronoi region R:
compute set N of relevant needles
q2
determine V1 (N )
q1
calculate intersection V1 (N ) ∩ R
q10 q
with this: determine Vj+1 (S) ∩ R

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S)
From Vj to Vj+1 :
p
For every Voronoi region R:
compute set N of relevant needles
q2
determine V1 (N )
q1
calculate intersection V1 (N ) ∩ R
q10 q
with this: determine Vj+1 (S) ∩ R

Computing V1 (·) with algorithm by Bae et al. [Bae, Kim, Chwa, 2009]

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Iterative Construction of Vk – Algorithm
compute V1 (S)
From Vj to Vj+1 :
p
For every Voronoi region R:
compute set N of relevant needles
q2
determine V1 (N )
q1
calculate intersection V1 (N ) ∩ R
q10 q
with this: determine Vj+1 (S) ∩ R

Computing V1 (·) with algorithm by Bae et al. [Bae, Kim, Chwa, 2009]

Theorem 2
The k -th order city Voronoi diagram can be computed
in O(k 2 (n + c) log(n + c)) time.

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Conclusion

City-Metric
first-order: impact of c is an Structural Complexity
additive constant first-order Θ(n + c)
farthest site: impact of c is
not an additive constant k th -order O(k(n − k) + kc)
Ω(n + kc)
farthest-site Θ(nc)
Open questions:
Tight bound for the structural Time Complexity
complexity? first-order O((n + c) log n)
Transportation network under
k th
-order O(k2 (n + c) log(n + c))
the Euclidean metric?
2
farthest-site O(nc log n log (n + c))

Institute of Theoretical Informatics

Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner
 Conclusion

City-Metric
first-order: impact of c is an Structural Complexity
additive constant first-order Θ(n + c)
farthest site: impact of c is
not an additive constant k th -order O(k(n − k) + kc)
Ω(n + kc)
farthest-site Θ(nc)
Open questions:
Tight bound for the structural Time Complexity
complexity? first-order O((n + c) log n)
Transportation network under
k th
-order O(k2 (n + c) log(n + c))
the Euclidean metric?
2
farthest-site O(nc log n log (n + c))
Thanks!
Institute of Theoretical Informatics
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner – Higher Order City Voronoi Diagrams. Prof. Dr. Dorothea Wagner