Triangular mesh structure isan important irregular mesh in data visualization. An effective way for reducing computation and memory requirements is to extract feature regions from massive data set

and only process (visualize

store

transmit

etc.) the data in these regions. For this reason

we give an algorithm for detecting edge points from triangular mesh data. The algorithm can be applied to adaptive subdivision of triangularm eshes.