Oversimplified euler operators for a non-oriented, non-manifold b-rep data structure

Authors:
Frutuoso G. M. Silva;Abel J. P. Gomes
Affiliations:
IT – Networks and Multimedia Group, Department of Computer Science and Engineering, University of Beira Interior, Portugal;IT – Networks and Multimedia Group, Department of Computer Science and Engineering, University of Beira Interior, Portugal
Venue:
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
Year:
2005

Citing 11
Cited 0

Introduction to Solid Modeling

Introduction to Solid Modeling
Progressive simplicial complexes

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)
Representations for Rigid Solids: Theory, Methods, and Systems

ACM Computing Surveys (CSUR)
Partial entity structure: a compact non-manifold boundary representation based on partial topological entities

Proceedings of the sixth ACM symposium on Solid modeling and applications
Performance Evaluation of Boundary Data Structures

IEEE Computer Graphics and Applications
A concise b-rep data structure for stratified subanalytic objects

Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Winged edge polyhedron representation.

Winged edge polyhedron representation.
Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments

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
AIF: a data structure for polygonal meshes

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, B-rep geometric kernels possess oriented data structures, i.e. they possess oriented cells (e.g. half-edges, co-edges, face uses, etc.). The use of explicit oriented cells makes these data structures quite verbose and expensive in terms of memory space. Although orientation is important for visualization and engineering analysis purposes, it gives rise to difficult issues at the representation level; for example, keeping inclusion relationships between incident surfaces at a non-manifold vertex. Instead, we propose a non-manifold B-rep data structure whose cells are not oriented. This facilitates the design and implementation of its associated Euler operators, each one of which then reduces itself to a sequence of insertion and removal operations of cells into or from a list. Besides, these Euler operators call a single query operator to retrieve all incidence and adjacency information through a minimal number of accesses. As a result, we obtain a simple, responsive, concise and general non-oriented, non-manifold B-rep geometric kernel.