ACM Home Page
Please provide us with feedback. Feedback
Adjacency and incidence framework: a data structure for efficient and fast management of multiresolution meshes
Full text PdfPdf (1.62 MB)
Source Computer graphics and interactive techniques in Australasia and South East Asia archive
Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia table of contents
Melbourne, Australia
SESSION: Meshes table of contents
Pages: 159 - 166  
Year of Publication: 2003
ISBN:1-58113-578-5
Authors
Frutuoso G. M. Silva  Universidade da Beira Interior
Abel J. P. Gomes  Universidade da Beira Interior
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/604471.604503
What is a DOI?

ABSTRACT

This paper introduces a concise and responsiveness data structure, called AIF (Adjacency and Incidence Framework), for multiresolution meshes, as well as a new simplification algorithm based on the planarity of neighboring faces. It is an optimal 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. These querying tools are necessary for dynamic multiresolution meshing algorithms (e.g. refinement and simplification operations). AIF is an orientable, but not oriented, data structure, i.e. an orientation can be topologically induced as needed in many computer graphics and geometric modelling applications. On the other hand, the simplification algorithm proposed in this paper is "memoryless" in the sense that only the current approximation counts to compute the next one; no information about the original shape or previous approximations is considered.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ASPERT, N., SANTA-CRUZ, D., AND EBRAHIMI, T. 2002. Mesh: Measuring errors between surfaces using the hausdorff distance. In Proc. of the IEEE International Conference in Multimedia and Expo (ICME), vol. 1, 705-708.
 
2
 
3
BRISSON, E. 1993. Representing geometric strutures in d dimension: topology and order. Discrete & Computational Geometry 9, 4, 387-426.
 
4
 
5
CAREY, R., BELL, G., AND MARRIN, C. 1997. The reality modeling language iso/iec 14772-1. Tech. rep., The VRML Consortium Incorporated.
 
6
 
7
CIGNONI, P., MONTANI, C., AND SCOPIGNO, R. 1997. A comparison of mesh simplification algorithms. Computers and Graphics 22, 1, 37-54.
8
9
 
10
 
11
GARLAND, M. 1999. Multiresolution modeling: Survey & future opportunities. In Eurographics '99 - State of the Art Reports, 111-131.
 
12
GUÉZIEC, A. 1995. Surface simplification with variable tolerance. In Second Annual Intl. Symp. on Medical Robotics and Computer Assisted Surgery (MRCAS '95), 132-139.
 
13
HECKBERT, P. S., AND GARLAND, M. 1997. Survey of polygonal surface simplification algorithms. In Siggraph'97 Course Notes 25.
14
15
 
16
HOPPE, H. 1998. View-dependent refinement of progressive meshes. Tech. rep., MSR-TR-98-02, Microsoft Research.
 
17
HUBELI, A., AND GROSS, M. 2000. A survey of surface representations for geometric modeling. Tech. rep., #335, Swiss Federal Institute of Technology Zurich.
 
18
 
19
 
20
KOBBELT, L., CAMPAGNA, S., AND SEIDEL, H.-P. 1998. A general framework for mesh decimation. In Graphics Interface, 43-50.
 
21
 
22
 
23
LOOP, C. 2000. Managing adjacency in triangular meshes. Tech. rep., No. MSR-TR-2000-24, Microsoft Research.
24
 
25
 
26
 
27
 
28
 
29
ROY, M., NICOLIER, F., FOUFOU, S., TRUCHETET, F., KOSCHAN, A., AND ABIDI, M. 2002. Assessment of mesh simplification algorithm quality. In Proceedings of SPIE Electronic Imaging, vol. 4661, 128-137.
30
31
 
32
TOUMA, C., AND GOTSMAN, C. 1998. Triangle mesh compression. In Proceedings of Graphics Interface'98, Morgan Haufmann Publishers, K. B. W. Davis and A. Fournier, Eds., 26-34.
33
 
34
WAVEFRONT TECHNOLOGIES, I. 1998. Wavefront file formats. Tech. rep., Version 4.0 RG-10-004 (1ł ed.), Santa Barbara, California, USA.
 
35
WEILER, K. 1985. Edge-based data structure for solid modelling in curved-surface environments. IEEE Computer Graphics and Applications 5, 1, 21-40.
 
36
WEILER, K. 1998. The radial edge struture: a topological representation for non-manifold geometric boundary modelling. Geometric Modelling for CAD applications.
37
 
38

Collaborative Colleagues:
Frutuoso G. M. Silva: colleagues
Abel J. P. Gomes: colleagues