Premium
An Edge‐Face Relational Scheme for Boundary Representations
Author(s) -
Ansaldi S.,
Floriani K.,
Falcidienc B.
Publication year - 1985
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.1985.tb00237.x
Subject(s) - adjacency list , enhanced data rates for gsm evolution , computer science , boundary (topology) , scheme (mathematics) , graph , face (sociological concept) , set (abstract data type) , boundary representation , object (grammar) , mathematics , theoretical computer science , topology (electrical circuits) , artificial intelligence , algorithm , combinatorics , mathematical analysis , social science , sociology , programming language
We propose a relational scheme for representing and modelling regular objects, which is based on the adjacency relations between faces and edges. In this structure, called edge‐face graph, the nodes represent the faces and the arcs the edges of the corresponding object. Other topological entities, such as vertices, loops of edges, and shells, can be obtained from this relational scheme. We give a formal description of the edge‐face graph, and the relationships between its properties and the topological entities of the object are analyzed in detail. Furthermore, a set of basic Euler operators based on the edge‐face adjacency relation is denned, which allow the incremental manipulation of boundary representations of solid objects.