• Keine Ergebnisse gefunden

Discrete and Computational Geometry, WS1516 Exercise Sheet “1”: Geometry Duality and Finding the Minimum University of Bonn, Department of Computer Science I

N/A
N/A
Protected

Academic year: 2022

Aktie "Discrete and Computational Geometry, WS1516 Exercise Sheet “1”: Geometry Duality and Finding the Minimum University of Bonn, Department of Computer Science I"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Discrete and Computational Geometry, WS1516 Exercise Sheet “1”: Geometry Duality and Finding the

Minimum

University of Bonn, Department of Computer Science I

• Written solutions have to be prepared untilWednesday 4th of Novem- ber, 12:00 pm.

• There is a letterbox in front of Room E.01 in the LBH builiding.

• You may work in groups of at most two participants.

Exercise 1: Geometry Duality II (4 Points) We define a geometry duality Ψ(·) as follows (O denotes the origin)

• For a point p= (a, b)∈R2\O, Ψ(p) maps to the lineax+by = 1.

• For a line L:ax+by = 1, Ψ(L) maps to the point (a, b).

Please prove the following.

For a point p∈ R2\O and a line L that does not pass through O, pand O are located in the same side of L if and only if Ψ(L) and O are located in the same side of Ψ(p).

Exercise 2: Geometry Duality II (4 Points) We define a geometry duality Φ(·) as follows

• For a point p= (a, b)∈R2, Φ(p) maps to the liney=ax−b.

• For a line L:y=ax−b, Φ(L) maps to the point (a, b).

(2)

Please prove the following.

For a point p∈R2 and a nonvertical line L,plies above Lif and only if Φ(L) lies above Φ(p).

Exercise 3: Finding the Minimum (4 Points) Givenr distinct numbers, let (a1, a2, . . . , ar) be a random permutation of the r numbers. Fori >1, Let Ai be the event thatai is smaller than all numbers in {a1, . . . , ai−1}. Please answer the following two questions.

• What is the probability Prob(Ai) of event Ai?

• What is the value of Pr

i=2Prob(Ai)?

2

Referenzen

ÄHNLICHE DOKUMENTE

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 “3”: Graph and Geometric Detour University of Bonn, Department of Computer Science I.. • Written solutions have to be

Discrete and Computational Geometry, WS1516 Exercise Sheet “7”: Convexity.. University of Bonn, Department of Computer

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

Please describe the probability function Pr by illustrating the proba- bility for the elements in the sample space4. (just one element for

Exercise 16: Randomized Incremental Algorithm for Abstract Voronoi Diagrams (History Graph) (4 Points) Consider an admissible bisecting curve system (S, J ), and make a general

• Present an argument that the Minkowski Theorem (Theorem 7) actu- ally says that 2 lattice points different from the origin will be inside the set C.. • Argue that the boundedness

Discrete and Computational Geometry, SS 14 Exercise Sheet “10”: Spanners and WSPDs.. University of Bonn, Department of Computer