Weitbrecht, Felix2020-06-192020-06-1920201717992781http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-109100http://elib.uni-stuttgart.de/handle/11682/10910http://dx.doi.org/10.18419/opus-10893Given an ordered sequence of points P = {p1, p2, ..., pn}, we consider all contiguous subsequences Pi,j := {pi, ..., pj} of P and the set T of distinct Delaunay triangles within their Delaunay triangulations. For arbitrary point sets and orderings, we give an O(n^2) bound on |T|. Furthermore, for arbitrary point sets in uniformly random order, we give two proofs of a Θ(n log n) bound on E[|T|].eninfo:eu-repo/semantics/openAccess004On the number of Delaunay Triangles occurring in all contiguous subsequencesmasterThesis