The need for an accurate simplification of surface meshes is becoming more and more urgent in many applications.It not only suits mulitiresolution/level-of-detailed representations and quick visualization
but also allows fast transmission of 3D models in network-based applications.Many different approaches and algorithms for mesh simplification have been proposed in the last few years.In this paper we present a new method
which partitions region by minimizing the maximum intercluster distance clustering algorithm
extracts features in every region and triangulates them by constrained delaunay triangulation.The results of examples illustrate our simplification method is effective.