Name
Abstract | ||
|---|---|---|
Newer spatial technologies, such as spatio-temporal databases, geo-sensor networks, and other remote sensing methods, require mechanisms to efficiently process spatial data and identify (and in some cases fix) data items that do not conform to rigorously defined spatial data type definitions. In this paper, we propose an $O(n \lg n )$ time complexity algorithm that examines a spatial configuration, eliminates any portions of the configuration that violate the definition of spatial regions, and constructs a valid region out of the remaining configuration. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02279-1_42 | SSDBM |
Keywords | Field | DocType |
geo-sensor network,spatial region,spatio-temporal databases,data item,spatial data,remaining configuration,lg n,spatial data type definition,newer spatial technology,region extraction,spatial configuration,time complexity,sensor network,remote sensing | Spatial analysis,Data mining,Computer science,Spatial configuration,Temporal database,Spatial query,Object-based spatial database,Simple polygon,Time complexity,Spatial database,Database | Conference |
Volume | ISSN | Citations |
5566 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark Mckenney | 1 | 4 | 1.43 |