Heuristics for Dynamic Delaunay Triangulation
MetadataVis full innførsel
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.