The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Walking on an arrangement topologically
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A data model and data structures for moving objects databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Topological relationships between complex spatial objects
ACM Transactions on Database Systems (TODS)
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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.