On-Line Simplification for Digital Map
-
摘要: 为了适应实时GIS的变比例尺显示与网络GIS的快速矢量数据传输,提出了数字地图的在线综合概念,讨论了对线目标的在线简化算法。提出的两个在线简化算法都是对DP简化算法进行改造,使算法对时间的复杂度从θ(n)~θ(n2)的乘法运算改进为θ(1)~θ(n)的赋值运算,并讨论了减少算法所涉及的空间复杂度的可能性。Abstract: For zooming in or out the map in a real time GIS application,and for quick transportation of the vector map in a network,this paper proposes the on-line map generalization concept.It discusses the on-line simplification to the line object in detail.Two algorithms are proposed.Their Complex are all from θ (1) to θ(n).It is a great progress comparing the normal DP algorithm whose complex is from θ(n) to θ(n2).The discussion about the reducing the spatial complex is also involved in the paper.
-
Keywords:
- computer algorithm analysis /
- binery tree /
- on-line simplification
-
计量
- 文章访问数: 805
- HTML全文浏览量: 61
- PDF下载量: 193