Impossible Geometry: Advancements in the Field of Counting Triangulations of Planar Point Sets

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Miltzow, T
dc.contributor.advisor	van der Hoog, I.D.
dc.contributor.author	Schukken, J.H.
dc.date.accessioned	2020-09-29T18:00:11Z
dc.date.available	2020-09-29T18:00:11Z
dc.date.issued	2020
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/37751
dc.description.abstract	Given a set of n points P in the plane, a triangulation of P is a maximal set of non-crossing edges between points in P. Counting the number of triangulations for a point set is a well known problem in the field of computational geometry. In this paper we present an overview of the previous 20 years of publications in the field of counting triangulations. We present four papers in the field that each represent significant advancements or interesting developments in the field. Additionally, we provide an implementation of the most recent and complex algorithm we present.
dc.description.sponsorship	Utrecht University
dc.format.extent	1771436
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.title	Impossible Geometry: Advancements in the Field of Counting Triangulations of Planar Point Sets
dc.type.content	Master Thesis
dc.rights.accessrights	Open Access
dc.subject.keywords	counting triangulations, triangulations, computational geometry, sub-exponential
dc.subject.courseuu	Computing Science