An edge-face relational scheme for boundary representations
Computer Graphics Forum
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Creating volume models from edge-vertex graphs
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Winged edge polyhedron representation.
Winged edge polyhedron representation.
A graph based approach to object feature recognition
SCG '87 Proceedings of the third annual symposium on Computational geometry
A hierarchical boundary model for solid object representation
ACM Transactions on Graphics (TOG)
Feature Extraction from Boundary Models of Three-Dimensional Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
ACM Transactions on Graphics (TOG)
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Efficient face-based feature recognition
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Supporting the design process with hypergraph genetic operators
Advanced Engineering Informatics
| Hi-index | 0.00 |
A relational graph structure based on a boundary representation of solid objects is described. In this structure, called face adjacency graph, nodes represent object faces, whereas edges and vertices are encoded into arcs and hyperarcs. Based on the face adjacency graph, we define a set of primitive face-oriented Euler operators, and a set of macrooperators for face manipulation, which allow a compact definition and an efficient updating of solid objects. We briefly describe a hierarchical graph structure based on the face adjacency graph, which provides a representation of an object at different levels of detail. Thus it is consistent with the stepwise refinement process through which the object description is produced.