Heuristics for Dynamic Delaunay Triangulation
| dc.contributor.advisor | Hetland, Magnus Lie | |
| dc.contributor.author | Fielding, Victor | |
| dc.date.accessioned | 2018-11-15T15:01:08Z | |
| dc.date.available | 2018-11-15T15:01:08Z | |
| dc.date.created | 2018-06-11 | |
| dc.date.issued | 2018 | |
| dc.identifier | ntnudaim:15853 | |
| dc.identifier.uri | http://hdl.handle.net/11250/2573099 | |
| dc.description.abstract | An efficient algorithm for heuristic dynamic Delaunay triangulation has been produced. Heuristics have been tested and present a trade off between speed and accuracy. A heuristic has been made that yields a triangulation with a very high Delaunay validity and a large speedup. | |
| dc.language | eng | |
| dc.publisher | NTNU | |
| dc.subject | Datateknologi, Intelligente systemer | |
| dc.title | Heuristics for Dynamic Delaunay Triangulation | |
| dc.type | Master thesis |
