Name
Abstract | ||
|---|---|---|
A contour tree is a good graphical tool for representing the spatial relations of contour lines and has found many applications in map generalization, map annotation, terrain analysis, etc. A new approach for generating contour trees by introducing a Voronoi-based interior adjacency set concept is proposed in this paper. The immediate interior adjacency set is employed to identify all of the children contours of each contour without contour elevations. It has advantages over existing methods such as the point-in-polygon method and the region growing-based method. This new approach can be used for spatial data mining and knowledge discovering, such as the automatic extraction of terrain features and construction of multi-resolution digital elevation model. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.cageo.2003.06.001 | Computers & Geosciences |
Keywords | Field | DocType |
Contour tree,Voronoi diagram,Spatial relations,Immediate adjacency,Interior | Adjacency list,Spatial relation,Data mining,Computer science,Terrain,Region growing,Cartographic generalization,Voronoi diagram,Artificial intelligence,Geometry,Polygon,Pattern recognition,Contour line | Journal |
Volume | Issue | ISSN |
30 | 4 | 0098-3004 |
Citations | PageRank | References |
4 | 0.44 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Chen | 1 | 207 | 21.33 |
| Chaofei Qiao | 2 | 4 | 0.78 |
| Renliang Zhao | 3 | 31 | 5.85 |