Finite-Resolution Simplicial Complexes

  • Authors:
  • Werner Hölbling;Werner Kuhn;Andrew U. Frank

  • Affiliations:
  • Department of Geoinformation, Technical University Vienna, Gusshausstrasse 27-29, A-1040 Vienna, Austria Email: hoelbling@geoinfo.tuwien.ac.at;Department of Geoinformation, Technical University Vienna, Gusshausstrasse 27–29, A-1040 Vienna, Austria.;Department of Geoinformation, Technical University Vienna, Gusshausstrasse 27–29, A-1040 Vienna, Austria Email: frank@geoinfo.tuwien.ac.at

  • Venue:
  • Geoinformatica
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

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.