• Keine Ergebnisse gefunden

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

N/A
N/A
Protected

Academic year: 2022

Aktie "Discrete and Computational Geometry, WS1516 Exercise Sheet “7”: Convexity University of Bonn, Department of Computer Science I"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Discrete and Computational Geometry, WS1516 Exercise Sheet “7”: Convexity

University of Bonn, Department of Computer Science I

• Written solutions have to be prepared until Friday 15th of January, 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 15: Diameter of a set (4 Points)

Let X ⊆R2. Please prove the Following:

diam(conv(X)) = diam(X),

where the diameter diam(Y) of a set Y is sup{||x−y|| |x, y ∈Y}.

Exercise 16: Radon Point (4 points)

For a (d+ 2)-point set in Rd, a point x∈Rd is called Radon point of A if it is contained in convex hulls of two disjoint subsets of A. Prove that if A is in general position (no d+ 1 points affinely depedent), then its Radon point is unique.

Referenzen

ÄHNLICHE DOKUMENTE

[r]

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 “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