OVERALL DELAUNAY TRIANGULATION OF 2D SCATTERED DATA WITH CHARACTERISTIC CONSTRAINTS
LU Zhaoyan · Chinese Journal of Computers · 1997
This paper presents an algorithm for overall Delaunay triangulation of 2D scattered data with characteristic constraints. The outer polygonal boundary and/or inner polygonal holes that scattered data may have and the characteristic constraints which could be polylines and/or polygons are stored in a generic data structure. The overall Delaunay properties could be satisfied by inserting fewer points using ahalf-separated additional characteristic point inserting technique.