Abstract
Simplicial complexes are used to model topology in Geographic Information Systems (GIS). Line intersection is an essential operation to update them. We introduce a finite-resolution line intersection method, called Zero Order Intersection, and apply it to simplicial complexes. Any reliable implementation of a line intersection algorithm has to address the limitations of a discrete computational environment. If handled improperly, finite representation can cause drifting lines and similar effects in otherwise topologically consistent data. The Zero Order Intersection method is designed to avoid such inconsistencies. Its application to simplicial complexes results in the Discrete Simplicial Data Model which guarantees consistency and reliability of topological queries within a GIS.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
