• Keine Ergebnisse gefunden

MA-INF 1203 Discrete and Computational Geometry Wintersemester 2019/20

N/A
N/A
Protected

Academic year: 2022

Aktie "MA-INF 1203 Discrete and Computational Geometry Wintersemester 2019/20"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

MA-INF 1203 Discrete and Computational Geometry Wintersemester 2019/20

Assignment 4

Deadline: 5 November before noon (To be discussed: 5/6. November 2019)

1 Duality

a) LetX⊂Rd be a closed convex set containing the origin. Prove thatX = (X). b) For a finite setX⊂Rd, prove that ((X))= conv(X∪ {0}).

2 Lifting

a) LetD⊂R3 be any disk in the hyperplane given by the equationx3= 0. A disk which belongs to the hyperplanex3 = 0, with center (a1, a2,0)∈R3, and radius r >0 is equal to the set {(x1, x2,0) ∈ R3 | (x1 −a1)2+ (x2−a2)2 ≤r2}. Show that there exists a half-space h such that D is the vertical projection of the set h∩U onto x3 = 0 where U ={x∈R3|x3=x21+x22} is the unit paraboloid.

b) Considernarbitrary circular disks D1, . . . , Dn in the plane. Show that there exist only O(n) intersections of their boundaries that lie inside no otherDi (this means that the boundary of the union of the Di consists of O(n) circular arcs).

3 Voronoi diagrams

Letd= 2k+ 1 be odd, let e1, . . . , ed be vectors of the standard orthonormal basis inRd, and lete0 stand for the zero vector. Fori= 0,1, . . . , k and j= 1,2, . . . , n, let pi,j =e2i+nje2i+1. a) Prove that for every choice ofj0, j1, . . . , jk∈ {1,2, . . . , n}, there is a pointq inRdwith

q = j0

n, x1,j1

n, x2,j2

n, . . . , xk,jk n

for some real values x1, . . . , xk such that the points which are nearest to q among the pi,j are exactlyp0,j0, p1,j1, . . . , pk,jk.

b) Conclude that the total number of faces of all dimensions in the Voronoi diagram of the pi,j is Ω(nk+1) = Ω(ndd/2e).

Referenzen

ÄHNLICHE DOKUMENTE

Now consider a different set of rules: hitting D 0 in at least 1 out of 5 independent attempts gives a win, while otherwise the game is lost. Once again assume that each dart hits

[r]

The algorithm sorts the numbers stored in an array by repeatedly partitioning a range of the array with respect to a randomly chosen pivot element.. Assume that the input numbers

We make a general position assumption that no more than three points of S are located on the same circle.. Please explain that the number of vertices will not increase without

Discrete and Computational Geometry, WS1516 Exercise Sheet “9”: Convex Polytope.. University of Bonn, Department of Computer

How to use Chan’s randomized technique and the decision algorithm for the geometric dilation of a polygonal chain to develop an optimization algorithm3. Abstract

Discrete and Computational Geometry, WS1415 Exercise Sheet “10”:.. University of Bonn, Department of Computer

Present the idea of how the crossing number Theorem is used for the upper bound on I(m,n) in the Szemeredi-Trotter Theorem?. Well-separated