Comparing G-maps with other topological data structures
- 465 Downloads
This article compares two approaches to storing spatial information: On the one hand there are topological datatypes where primitives and their connectivity are explicitly stored, on the other hand there is the G-maps-approach storing abstract “darts” and groups acting on these darts such that their orbits implicitly give the elements and topology of the stored space. First these concepts are mutually related from a categorial viewpoint and, second, their storage complexity is compared.
KeywordsG-maps Spatial modelling Topology Storage complexity
The authors acknowledge support from the DFG-projects BR 3513/3, and BR 2128/12 and many valuable comments from the anonymous reviewers.
- 1.Alexandroff P (1937) Diskrete Räume. Mat Sb 44(2):501–519Google Scholar
- 2.Bradley PE, Paul N (2010) Using the relational model to capture topological information of spaces. Comput J 53(1):69–89Google Scholar
- 5.Hartshorne R (1977) Algebraic Geometry. Springer, New YorkGoogle Scholar
- 8.Mäntylä M (1988) An introduction to solid modeling. Computer Science, Rockville, MDGoogle Scholar
- 9.Paul N (2008) Topologische Datenbanken für Architektonische Räume. Dissertation, Universität KarlsruheGoogle Scholar
- 10.Paul N (2010) Basic topological notions and their relation to BIM. In: Underwood J, Isikdag U (ed) Handbook of research on building information modeling and construction informatics—information science reference, pp 451–472Google Scholar
- 11.Schneps L (ed) (1994) The Grothendieck theory of Dessins d’Enfants. Cambridge University Press, Cambridge, MAGoogle Scholar
- 12.Sloane NJA (ed) (2012) Number of self-inverse permutations on n letters, also known as involutions; number of Young tableaux with n cells. In: On-line encyclopedia of integer sequences. http://www.research.att.com/~njas/sequences/A000085