Filters








9,751 Hits in 1.4 sec

Selectively Refinable Subdivision Meshes [article]

Enrico Puppo
2006 Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing  
We introduce RGB triangulations, an extension of red-green triangulations that can support selective refinement over subdivision meshes generated through quadrisection of triangles.  ...  Our mechanism permits to take an adaptive mesh at intermediate level of subdivision and process it through both refinement and coarsening operations, by remaining consistent with an underlying Loop subdivision  ...  We have developed our selective refinement algorithm for the Loop subdivision scheme.  ... 
doi:10.2312/sgp/sgp06/153-162 fatcat:pysv4dr2vndtnidtlqwetgp27y

Incremental subdivision for triangle meshes

Hamid Reza Pakdel, Faramarz F. Samavati
2007 International Journal of Computational Science and Engineering (IJCSE)  
While regular (global) subdivisions produce a smooth surface from a given polygon mesh by refining all of its faces, adaptive subdivision produces a surface by refining only some selected areas of the  ...  Consequently, the selected area becomes fine and high resolution while the rest of mesh is coarse.  ...  ACKNOWLEDGEMENTS We are grateful to Peter MacMurchy and Colin Smith for their help and discussion on adaptive subdivision. In addition, we would like to thank John Brozs and Maria Perdomo.  ... 
doi:10.1504/ijcse.2007.014467 fatcat:3d35undm4jennn3feq3pckjtvu

Simplicial-based Multiresolution Volume Datasets Management: An Overview [chapter]

Rita Borgo, Paolo Cignoni, Roberto Scopigno
2004 Mathematics and Visualization  
In particular, we review those multiresolution approaches based on simplicial meshes.  ...  The methodologies available are classified in two main streams, according to the regular or irregular refinement kernel adopted to build the multiresolution representation.  ...  The refinement process can be applied selectively, but it is important to maintain the refined mesh conforming, i.e. the subdivision of a cell on edge e will force the subdivision of all the ones sharing  ... 
doi:10.1007/978-3-662-07443-5_19 fatcat:trcarfdi6ffz5ifqycgtutl3sy

Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality

V. Pascucci
2002 Computer graphics forum (Print)  
The main four qualities of our subdivision procedure are: (i) the rate of refinement does not grow with the dimension of the mesh, (ii) adaptive refinement of the mesh is possible without introducing special  ...  tensor-product refinements.  ...  From tier 0 to tier 1 For each cell c i in the input mesh its center p i is selected.  ... 
doi:10.1111/1467-8659.t01-1-00605 fatcat:3p2ykc2ivfdzpflxhs73fm57kq

Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality

Valerio Pascucci
2002 Computer graphics forum (Print)  
The main four qualities of our subdivision procedure are: (i) the rate of refinement does not grow with the dimension of the mesh, (ii) adaptive refinement of the mesh is possible without introducing special  ...  tensor-product refinements.  ...  From tier 0 to tier 1 For each cell c i in the input mesh its center p i is selected.  ... 
doi:10.1111/1467-8659.00605 fatcat:wunuomyshnh5bcrffcntht2cty

Implicit Hierarchical Quad-Dominant Meshes

Daniele Panozzo, Enrico Puppo
2011 Computer graphics forum (Print)  
Topological LOD editing is controlled with local conforming operators, which support both mesh refinement and mesh coarsening.We show two possible applications of this method: we define an adaptive subdivision  ...  We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refinement and adaptive coarsening.  ...  A selectively refined mesh will also contain vertices and edges labeled according to their level of subdivision; edges will be labeled with either type standard or type extra.  ... 
doi:10.1111/j.1467-8659.2011.01847.x fatcat:gkofvogdgfebldqzp5bqj3p7hq

Iterative Process To Improve Simple Adaptive Subdivision Surfaces Method With Butterfly Scheme

Noor Asma Husain, Mohd Shafry Mohd Rahim, Abdullah Bade
2011 Zenodo  
Subdivision surfaces were applied to the entire meshes in order to produce smooth surfaces refinement from coarse mesh.  ...  Although adaptive subdivision occurs at the selected areas, the quality of produced surfaces which is their smoothness can be preserved similar as well as regular subdivision.  ...  Subdivision schemes were applied to the whole coarse meshes and refined globally at every level of subdivision. This can lead to a huge computational load at higher levels of subdivision.  ... 
doi:10.5281/zenodo.1062409 fatcat:dgighwu6uvf75ctzgoe26pada4

Effective adaptation technique for hexahedral mesh

Yoshitaka Wada, Hiroshi Okuda
2002 Concurrency and Computation  
Utilize Hex-R which refine an existing mesh. Refined mesh keeps original coarse mesh topologically. Finally capability of adaptive method using Hex-R is mentioned.  ...  Hex-R reads numbers of elements to be refined and write a refined mesh out. Figure 1 shows a process of recursive mesh refinement. Firstly elements to be refined are selected in Figure 1 (a).  ...  The Hex-R generates a refined mesh as shown Figure 1 (b). Secondly the elements are selected again in Figure 1 (c).  ... 
doi:10.1002/cpe.624 fatcat:dnwkgv7ulbf5zkkikxslhvamqu

Efficient view-dependent refinement of 3D meshes using sqrt{3}-subdivision

Pierre Alliez, Nathalie Laurent, Henri Sanson, Francis Schmitt
2003 The Visual Computer  
We demonstrate that the √ 3 subdivision operator recently introduced by Kobbelt offers many benefits, including view-dependent refinement, removal of polygonal aspect and highly tunable level of detail  ...  In this paper we introduce an efficient view dependent refinement technique well-suited to adaptive visualization of 3D triangle meshes on a graphic terminal.  ...  Bottom right: the refined mesh seen from the back. Efficient View-Dependent Refinement of 3D Meshes using √ 3-Subdivision 11 Fig. 11 Nefertiti mesh.  ... 
doi:10.1007/s00371-002-0165-z fatcat:iofcfh7cu5hxdekexsa63vaxuy

Adaptive and Feature-Preserving Subdivision for High-Quality Tetrahedral Meshes

D. Burkhart, B. Hamann, G. Umlauf
2010 Computer graphics forum (Print)  
We present an adaptive subdivision scheme for unstructured tetrahedral meshes inspired by the √ 3-subdivision scheme for triangular meshes.  ...  Our subdivision algorithm design emphasizes on geometric quality of the tetrahedral meshes, local and adaptive refinement operations, and preservation of sharp geometric features on the boundary and in  ...  The strategy of adaptive refinement for our tetrahedral subdivision scheme is as follows: If a tetrahedron is selected to be not refined, the 1-4 split is not applied.  ... 
doi:10.1111/j.1467-8659.2009.01581.x fatcat:2hniobas7zb3xjbpcluvuexmni

A progressive subdivision paradigm (PSP)

Rita Borgo, Valerio Pascucci, Roberto Scopigno, Paolo Cignoni, Robert F. Erbacher, Philip C. Chen, Jonathan C. Roberts, Matti T. Gr÷hn, Katy B÷rner
2004 Visualization and Data Analysis 2004  
Subdivision methods in recent years have been one of the most successful techniques applied to the multiresolution representation and visualization of surface meshes.  ...  In this paper we address mainly the first part of the problem, presenting a framework that exploits a subdivision scheme suitable for extension to 3D and higher dimensional meshes.  ...  From tier 0 to tier 1 . 1 For each cell c i in the input mesh its center p i is selected.  ... 
doi:10.1117/12.539254 dblp:conf/vda/BorgoPSC04 fatcat:grxujmg5fbgqhirdpi7tm54dki

Adaptive LOD editing of quad meshes

Daniele Panozzo, Enrico Puppo
2010 Proceedings of the 7th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa - AFRIGRAPH '10  
a) (b) (c) Figure 1 : A base mesh composed of three cubes (a); the mesh is adaptively refined to smooth three straight edges (b); the same mesh uniformly refined at level 2 by using the standard Catmull  ...  Starting at a base mesh, we generate a quad-dominant mesh which is consistent with the Catmull-Clark subdivision.  ...  A selectively refined mesh will also contain vertices and edges labeled according to their level of subdivision; edges will be labeled with either type standard or type extra.  ... 
doi:10.1145/1811158.1811160 dblp:conf/afrigraph/PanozzoP10 fatcat:prnogxlkd5bd7d5mjw3zwn766a

A mesh refinement library based on generic design

Le-Jeng Shiue, Jörg Peters
2005 Proceedings of the 43rd annual southeast regional conference on - ACM-SE 43  
The Flexible Subdivision Library, FSL, is a policy-based C++ template library for refining geometric meshes.  ...  Any specific subdivision strategy is efficiently realized by a user-defined geometry policy.  ...  To realize a new subdivision algorithm, a programmer selects the host and specifies the geometry policy. Currently, four hosts are implemented in FSL.  ... 
doi:10.1145/1167350.1167388 dblp:conf/ACMse/ShiueP05 fatcat:e2qu2p76dbbpni6xswbzlvdgo4

Iterative Image Coding Using Hybrid Wavelet-Based Triangulation [chapter]

Phichet Trisiripisal, Sang-Mook Lee, A. Lynn Abbott
2006 Lecture Notes in Computer Science  
This paper presents a novel hierarchical subdivision scheme for generating triangular meshes to represent intensity images.  ...  Mesh node locations are selected using multiresolution wavelet-based analysis, and this leads to a piecewise-linear approximation of image intensity values.  ...  Wavelet coefficients are used directly in selecting mesh node locations, in selecting node interconnections, and for mesh refinement.  ... 
doi:10.1007/978-3-540-69423-6_31 fatcat:4bkmd2e72jbvvhww2zvmmtjnoa

√3-subdivision

Leif Kobbelt
2000 Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00  
The size of the surrounding mesh area which is affected by selective refinement is smaller than for the dyadic split operation.  ...  The new splitting operation enables locally adaptive refinement under builtin preservation of the mesh consistency without temporary crackfixing between neighboring faces from different refinement levels  ...  Acknowledgements I would like to thank Stephan Bischoff and Ulf Labsik for implementing the ¢ 3-subdivision scheme and performing some of the experiments.  ... 
doi:10.1145/344779.344835 dblp:conf/siggraph/Kobbelt00 fatcat:k3tzdzwohnepnlyd3pwqp6lepa
« Previous Showing results 1 — 15 out of 9,751 results