A General Model for Adjacency

Authors:
Merja Wanne;Matti Linna
Affiliations:
(Correspd.) Department of Information Technology and Production Economics, University of Vaasa, P.O.Box 700, Vaasa, Finland. Merja.Wanne@uwasa.fi;(Correspd.) Department of Information Technology and Production Economics, University of Vaasa, P.O.Box 700, Vaasa, Finland. Matti.Linna@uwasa.fi
Venue:
Fundamenta Informaticae
Year:
1999

Citing 8
Cited 0

Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
A hierarchical boundary model for solid object representation

ACM Transactions on Graphics (TOG)
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
Introduction to Database Systems

Introduction to Database Systems
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Performance Anomalies in Boundary Data Structures

IEEE Computer Graphics and Applications
Performance Evaluation of Boundary Data Structures

IEEE Computer Graphics and Applications
A polyhedron representation for computer vision

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers adjacency relation systems introduced by Wanne [10] (1998). The main problems studied are how to characterize the sets of relations, which uniquely define all other adjacency relations, and how one can determine whether a given set of relations satisfies this property. The paper contains the solutions of both questions. One of the goals in introducing the adjacency relation systems has been the development of a theory, which can be used to model databases.