Tadej Števančec (2016) Plane Delaunay triangulation. EngD thesis.
Abstract
Delaunay triangulation is one of the fundamental data structures in computational geometry. In the thesis we present the planar Delaunay triangulation and describe its construction. Several types of algorithms for building a two-dimensional Delaunay triangulation exist, the most popular are randomized incremental algorithms. We implemented the Bowyer-Watson algorithm in the programming language Java and tested it on a number of samples of randomly generated point sets. The expected degree of a vertex in a triangulation is an important parameter in many algorithms for constructing triangulations. Theoretical expectations for average and maximal vertex degrees are compared with the obtained values.
| Item Type: | Thesis (EngD thesis) |
|---|
| Keywords: | computational geometry, planar triangulation, planar Delaunay triangulation, randomized incremental algorithm, Bowyer-Watson algorithm, vertex degree, expected maximum vertex degree |
|---|
| Number of Pages: | 52 |
|---|
| Language of Content: | Slovenian |
|---|
| Mentor / Comentors: | | Name and Surname | ID | Function |
|---|
| prof. dr. Neža Mramor Kosta | 242 | Mentor |
|
|---|
| Link to COBISS: | http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537049027) |
|---|
| Institution: | University of Ljubljana |
|---|
| Department: | Faculty of Computer and Information Science |
|---|
| Item ID: | 3395 |
|---|
| Date Deposited: | 06 Jul 2016 15:10 |
|---|
| Last Modified: | 02 Aug 2016 14:52 |
|---|
| URI: | http://eprints.fri.uni-lj.si/id/eprint/3395 |
|---|
Actions (login required)
![[img]](http://eprints.fri.uni-lj.si/style/images/fileicons/application_pdf.png)
