• Keine Ergebnisse gefunden

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

N/A
N/A
Protected

Academic year: 2022

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

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

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

Assignment 2

To be discussed: 22/23. October 2019

1 Affine Hull

• For any set X ✓ Rd, let a↵\(X) denote the intersection of all affine subspaces of Rd containing X.

• For any setX ✓Rd, let a↵c(X) denote the set of all affine combinations of points ofX.

Prove that a↵\(X) = a↵c(X).

2 Convex Hull

i) Prove that the set of all convex combinations of x1, . . . , xn2Rd is a convex set.

ii) Prove by induction on n that the set of all convex combinations of x1, . . . , xn 2 Rd is contained in the convex hull of the set {x1, . . . , xn}.

iii) Prove that for any closed set X the convex hull conv(X) is equal to the intersection of all closed halfspaces that contain X.

3 Translated copies

LetK ⇢Rdbe a convex set and let C1, . . . , Cn✓Rd,n d+ 1, be convex sets such that the intersection of everyd+1 of them contains a translated copy ofK. Prove that the intersection of all setsCi also contains a translated copy ofKthat is9t2Rd: {t+x|x2K}✓Tn

i=1Ci.

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

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

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

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