AIF: a data structure for polygonal meshes

Authors:
Frutuoso G. M. Silva;Abel J. P. Gomes
Affiliations:
IT, Networks and Multimedia Group, Department of Informatics, UBI, Portugal;IT, Networks and Multimedia Group, Department of Informatics, UBI, Portugal
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 11
Cited 3

Introduction to Solid Modeling

Introduction to Solid Modeling
Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Interactive multiresolution mesh editing

Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Geometric compression through topological surgery

ACM Transactions on Graphics (TOG)
Multiresolution mesh morphing

Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Directed edges—A scalable representation for triangle meshes

Journal of Graphics Tools
Star-vertices: a compact representation for planar meshes with adjacency information

Journal of Graphics Tools
Performance Evaluation of Boundary Data Structures

IEEE Computer Graphics and Applications
FastMesh: Efficient View-Dependent Meshing

PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
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 concise b-rep data structure for stratified subanalytic objects

Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Representing non-manifold geometric objects in n dimensions: incidence, order, and shape

ISCGAV'06 Proceedings of the 6th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Oversimplified euler operators for a non-oriented, non-manifold b-rep data structure

ISVC'05 Proceedings of the First international conference on Advances in Visual Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Meshing is an important topic in geometric modelling and computer graphics. This paper introduces a concise and fast data structure, called AIF (Adjacency and Incidence Framework). Its conciseness results from the fact that it is an orientable, but not an oriented, data structure, i.e. an orientation can be topologically induced as necessary in many applications. It is an optimal C49 data structure for polygonal meshes, manifold and non-manifold, which means that a minimal number of direct and indirect accesses are required to retrieve adjacency and incidence information from it. In fact, it operates close to real-time even for huge meshes, what becomes it appropriate for real-time applications (e.g. multiresolution meshing refinement and simplification operations).