The algorithm about region feature divided by straight-line was described by this paper, and it was based on the programming environment of VB6.0 + MAPX5.0. There are three cases were taken into account in this algorithm: the first, the points of intersection do not overlap with the vertices of region feature; the second, the points of intersection just overlap with the last vertex of region feature; and finally, the points of intersection overlap with other vertices except the last vertex of region feature. The results show that, this algorithm is stable and effective. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Wu, D., Feng, X., & Wen, Q. (2011). The segmentation algorithm of region feature based on MAPX. Advances in Intelligent and Soft Computing, 105, 657–661. https://doi.org/10.1007/978-3-642-23756-0_105
Mendeley helps you to discover research relevant for your work.