Geometric and thematic integration of spatial data into maps

The map construction problem (MCP) is defined as a spatial data integration problem relating to the integration of region data into map data. Although a purely geometric integration of regions into a map is known and is efficient, algorithms preserving thematic data of regions are much more difficul...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Information Reuse and Integration pp. 201 - 206
Main Author McKenney, M
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2010
Subjects
algorithms
Complexity theory
data management
Data visualization
Geographic information systems
Image segmentation
Region 1
Region 2
Region 3
spatial data structures
Spatial databases
Online AccessGet full text
ISBN1424480973
9781424480975
DOI10.1109/IRI.2010.5558941

Cover

More Information
Summary:The map construction problem (MCP) is defined as a spatial data integration problem relating to the integration of region data into map data. Although a purely geometric integration of regions into a map is known and is efficient, algorithms preserving thematic data of regions are much more difficult. A naive approach to the MCP runs in O((nm lg nm) 2 + k) time for m regions composed with n line segments on average with k line segment intersections. A new O((n+k)(lg n+m+lg m 2 )) algorithm is presented to solve the MCP. The algorithm has been implemented and experiments show that it is significantly faster than the naive approach.
ISBN:1424480973
9781424480975
DOI:10.1109/IRI.2010.5558941