OPTIMAL TRIANGULATION OF DATA POINTS SCATTERED IN ARBITRARY POLYGON WITH CHARACTERISTIC CONSTRAINTS

This paper presents an algorithm based on the Delaunay strategy for optimal triangulation of data points scattered in 2D region with polygonal boundary.The characteristic constraints of the data,which could be polylines and/or polygons with any complicated contour,can be imposed on the triangulation.A generic data structure is used to store the scattered data,their constraints and triangulation information.Besides,an auxiliary window is introduced to facilitate the construction and programming.