Please use this identifier to cite or link to this item:
http://dx.doi.org/10.18419/opus-10893
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Weitbrecht, Felix | - |
dc.date.accessioned | 2020-06-19T12:42:11Z | - |
dc.date.available | 2020-06-19T12:42:11Z | - |
dc.date.issued | 2020 | de |
dc.identifier.other | 1717992781 | - |
dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-109100 | de |
dc.identifier.uri | http://elib.uni-stuttgart.de/handle/11682/10910 | - |
dc.identifier.uri | http://dx.doi.org/10.18419/opus-10893 | - |
dc.description.abstract | Given 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|]. | en |
dc.language.iso | en | de |
dc.rights | info:eu-repo/semantics/openAccess | de |
dc.subject.ddc | 004 | de |
dc.title | On the number of Delaunay Triangles occurring in all contiguous subsequences | en |
dc.type | masterThesis | de |
ubs.fakultaet | Informatik, Elektrotechnik und Informationstechnik | de |
ubs.institut | Institut für Formale Methoden der Informatik | de |
ubs.publikation.seiten | 19 | de |
ubs.publikation.typ | Abschlussarbeit (Master) | de |
Appears in Collections: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Masterarbeit.pdf | 226,91 kB | Adobe PDF | View/Open |
Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.