ACM Home Page
Please provide us with feedback. Feedback
A pattern-based data structure for manipulating meshes with regular regions
Full text PdfPdf (452 KB)
Source GI; Vol. 112 archive
Proceedings of Graphics Interface 2005 table of contents
Victoria, British Columbia
SESSION: Geometric modeling table of contents
Pages: 153 - 160  
Year of Publication: 2005
ISBN ~ ISSN:0713-5424 , 1-56881-265-5
Authors
Le-Jeng Shiue  University of Florida
Jörg Peters  University of Florida
Sponsor
CHCCS : The Canadian Human-Computer Communications Society
Publisher
Canadian Human-Computer Communications Society  School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Automatically generated or laser-scanned surfaces typically exhibit large clusters with a uniform pattern. To take advantage of the regularity within clusters and still be able to edit without decompression, we developed a two-level data structure that uses an enumeration by orbits and an individually adjustable stencil to flexibly describe connectivity. The structure is concise for storing mesh connectivity; efficient for random access, interactive editing, and recursive refinement; and it is flexible by supporting a large assortment of connectity patterns and subdivision schemes.


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
Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Levy, and Mathieu Desbrun. Anisotropic polygonal remeshing. In SIGGRAPH '03 Conference Proceedings, pages 485--493, 2003.
 
2
Bruce G. Baumgart. A polyhedron representation for computer vision. In Proceedings of the National Computer Conference, pages 589--596, 1975.
 
3
 
4
E. Catmull and J. Clark. Recursively generated B-spline surfaces on arbitrary topological meshes. Computer Aided Design, 10:350--355, 1978.
 
5
D. Doo and M. Sabin. Behaviour of recursive division surfaces near extraordinary points. Computer-Aided Design, 10:356--360, September 1978.
 
6
L. De Floriani, L. Kobbelt, and E. Puppo. A survey on data structures for level-of-detail models. In N. Dodgson, M. Floater, and M. Sabin, editors, Advances in Multiresolution for Geometric Modelling, Series in Mathematics and Visualization, pages 49--74. Springer Verlag, 2004.
7
8
 
9
 
10
Kenneth I. Joy, Justin Legakis, and Ron MacCracken. Data structures for multiresolution representation of unstructured meshes. In Gerald Farin, Hans Hagen, and Bernd Hamann, editors, Hierarchical Approximation and Geometric Methods for Scientific Visualization. Springer-Verlag, 2002.
 
11
 
12
 
13
A. Levin and D. Levin. Analysis of quasi uniform subdivision. Applied and Computational Harmonic Analysis, 15(1):18--32, 2003.
 
14
Charles T. Loop. Smooth subdivision surfaces based on triangles, 1987. Master's Thesis, Department of Mathematics, University of Utah.
 
15
 
16
 
17
 
18
 
19
 
20
Jos Stam and Charles Loop. Quad/triangle subdivision. Computer Graphics Forum, 22:79--85, 2002.
 
21
 
22
Kevin Weiler. Edge-based data structures for solid modeling in curved-surface environments. IEEE Computer Graphics and Applications, 5(1):21--40, January 1985.


Collaborative Colleagues:
Le-Jeng Shiue: colleagues
Jörg Peters: colleagues