The aggregation of the topological neighbouring polygons developes well. There are some good algorithms, but the most are based on the topological spatial data model, it requests data build integrated topological relations. When the data is modified, we should vindicate the data's consistency, and it will cost so much time to rebuild the topological relations and even sometimes maybe failed. This paper presents a polygon- aggregation algorithm based on simple data model which have no topological relations. The simple data model doesn't need store topological relation, it can reduce the complicacy of operation. In the paper, it discusses finding the shared edges, evolving end points to nodes, linking continuous segments to arc and marking repeat edges for deletion, building topological relations between the node and edges, aggregating polygon using outlines at last. This method was used in practice, and it has good effect for large data quantity.
展开▼
