A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Multi-Layer Level of Detail For Character Animation
[article]
2008
Workshop on Virtual Reality Interactions and Physical Simulations
and selective mesh level of detail. ...
Animation and level of detail are well explored fields but little has been done to generate level of detail automatically for dynamic articulated meshes. ...
Taking into account the aspect ratio of triangles helps to select operations that improve mesh quality. A flat triangle has a compactness near zero and should be decimated in priority (Figure 9 ). ...
doi:10.2312/pe/vriphys/vriphys08/057-066
dblp:conf/vriphys/SavoyeM08
fatcat:hqvk7eujrzcjvd54ijrncidfma
Fast Mesh Simplification Method for Three-Dimensional Geometric Models with Feature-Preserving Efficiency
2019
Scientific Programming
The energy-operator can evaluate the smoothness and complexity of the regional mesh in 3D models. ...
To avoid excessive details, thus omitting less important content, of three-dimensional (3D) geometric models, this study proposes a fast mesh simplification method based on an energy-operator for 3D geometric ...
various levels of detail according to the complexity of models. ...
doi:10.1155/2019/4926190
fatcat:txgb46otnnbihfduwapozkgxgm
Progressive compression of manifold polygon meshes
2012
Computers & graphics
The input surface is decimated by several traversals that generate successive levels of detail through a specific patch decimation operator which combines vertex removal and local remeshing. ...
This paper presents a new algorithm for the progressive compression of manifold polygon meshes. ...
Acknowledgements The authors would like to thank Ho Lee for providing some experimental compression results first published in [7] and Jae-Kyun Ahn for providing the experimental compression results ...
doi:10.1016/j.cag.2012.03.023
fatcat:glgxztksmbelzi4e2jshvl47yu
Multiresolution analysis on irregular surface meshes
1998
IEEE Transactions on Visualization and Computer Graphics
Wavelet-based methods have proven their efficiency for the visualization at different levels of detail, progressive transmission, and compression of large data sets. ...
In particular, the necessity of subdivision-connectivity prevents the application of wavelet-based methods on irregular triangular meshes. ...
Need for an extension of wavelet theory There exist numerous algorithms for reducing the number of triangles in a mesh -independently of the data that is defined on this mesh. ...
doi:10.1109/2945.765329
fatcat:ctpfw7wkezfpfjayiva3j4kxei
Multiresolution decimation based on global error
1997
The Visual Computer
A multiresolution representation improves over LOD because: the user or the application have much more flexibility in the selection of the "best" level of detail; in many cases it is better to leave that ...
Moreover, we show that with a small increase in memory, which is needed to store the multiresolution data representation, we are able to extract any level of detail representation from the simplification ...
An executable (SGI version) of the JADE code is available on the public domain at address: http://miles.cnuce.cnr.it/cg/homepage.html . ...
doi:10.1007/s003710050101
fatcat:7d64hewtwveyromhu3ynhk2rvy
An Efficient Surface Reconstruction Pipeline for Particle-Based Fluids
[article]
2012
Workshop on Virtual Reality Interactions and Physical Simulations
In comparison to existing approaches, the decimation step alleviates the particle alignment related bumpiness very efficiently and reduces the number of triangles in flat regions. ...
After the scalar field computation and the marching cubes based triangulation, we post process the surface mesh by applying surface decimation and subdivision algorithms. ...
We also thank NVIDIA ARC GmbH for supporting this work. ...
doi:10.2312/pe/vriphys/vriphys12/061-068
dblp:conf/vriphys/AkinciAIT12
fatcat:dpkhdvv6jfbjfpxwyodksi5s74
Structure-Aware Mesh Decimation
2015
Computer graphics forum (Print)
We present a novel approach for the decimation of triangle surface meshes. ...
Our experiments on a variety of inputs illustrate the potential of our approach in terms of improved accuracy and preservation of structure. ...
The authors wish to thank Acute3D and InterAtlas for providing the urban meshes of Paris. This work is partially funded by an ERC Starting Grant "Robust Geometry Processing" (257474). ...
doi:10.1111/cgf.12531
fatcat:775d6eb3yrfyhl3c4taew5itym
Real-time mesh simplification using the GPU
2007
Proceedings of the 2007 symposium on Interactive 3D graphics and games - I3D '07
We can generate adaptive levels of detail by applying non-linear warping functions to the cluster map in order to improve resulting simplification quality. ...
encoding and variable level-of-detail. ...
We would also like to thank Szymon Rusinkiewicz of Princeton University for providing useful feedback and advice on early versions of this paper, as well as providing additional funding. ...
doi:10.1145/1230100.1230128
dblp:conf/si3d/DeCoroT07
fatcat:2ejn6ajmsvek3agpaern6uii4a
Tutorial 2 - Level-of-Detail in Surface and Volume Modeling
[article]
1999
Eurographics State of the Art Reports
of shape nodes at different level of detail (specified in order of decreasing details) G center field: object's baricenter used to compute viewing distance G range field: defines distances to switch between ...
Roberto Scopigno National Research Council Pisa Italy IEEE Vis'98 Tutorial G group node G specifies the shape of a single object at multiple level of details (children shape nodes specified in order of ...
doi:10.2312/egt.19991073
fatcat:tr2joavcl5hfjmr36wf3ivdxay
Appearance-Driven Automatic 3D Model Simplification
[article]
2021
arXiv
pre-print
We describe several use cases, including mesh decimation, level of detail generation, seamless mesh filtering and approximations of aggregate geometry. ...
We present a suite of techniques for jointly optimizing triangle meshes and shading models to match the appearance of reference scenes. ...
D MESH DECIMATION: VARYING TRIANGLE COUNT IN THE REDUCED MESH In Figure 17 we study quality as function of the triangle count in our initial guess for the Ewer model. ...
arXiv:2104.03989v1
fatcat:kygkk7edgjhsrhvgug7o3iyipu
Multiresolution hierarchies on unstructured triangle meshes
1999
Computational geometry
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. ...
Since smooth (subdivision) basis functions are no longer available in this generalized context, we use constrained energy minimization to associate smooth geometry with coarse levels of detail. ...
R is a restriction operator to go one level coarser. This is where the mesh decimation comes in. ...
doi:10.1016/s0925-7721(99)00032-2
fatcat:qemcnonrfjhs3p2bfy27d72d4a
Polygonal Meshing for 3D Stereo Video Sensor Data
2008
2008 Canadian Conference on Computer and Robot Vision
This complicates the process of constructing polygonal meshes from these point-clouds. ...
This paper develops an approach to meshing for stereo video surface reconstruction that addresses these issues and, by exploiting the known egomotion of the sensor, obtains surface normal and texture rendering ...
Acknowledgements The financial support of NSERC, the CBRN Research Technology Initiative (project number CRTI-05-0122) and MDA is gratefully acknowledged. ...
doi:10.1109/crv.2008.53
dblp:conf/crv/GillJ08
fatcat:aflrjenvh5cxndoccntv4zxihi
Cost-driven framework for progressive compression of textured meshes
2019
Proceedings of the 10th ACM Multimedia Systems Conference on - MMSys '19
For encoding the inverse mesh decimation steps we further contribute a significant improvement over the state-of-the-art in terms of rate-distortion performance and yields a compression-rate of 22:1, on ...
The goal of such a progressive mesh compression algorithm is to improve the overall quality of the transmission for the user, by optimizing the rate-distortion trade-off. ...
ACKNOWLEDGMENTS This work has been funded by Google, within the framework of the Chrome University Research Program. ...
doi:10.1145/3304109.3306225
dblp:conf/mmsys/PortaneriAHBS19
fatcat:sd2mbay4ajbf7osexge7n2bk7a
Interactive multi-resolution modeling on arbitrary meshes
1998
Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98
Putting mesh hierarchies, local frame coding and multi-level smoothing together allows us to propose a flexible and intuitive paradigm for interactive detail-preserving mesh modification. ...
the application of incremental mesh decimation. ...
If the mesh decimation scheme prefers those collapses that improve the global roundness, the resulting meshes tend to have only little variance in the lengths of the edges. ...
doi:10.1145/280814.280831
dblp:conf/siggraph/KobbeltCVS98
fatcat:zadxavkr4bdh5ml3ykkb7qww5y
Constrained Fairing for Meshes
2001
Computer graphics forum (Print)
In this paper, we present a novel fairing algorithm for the removal of noise from uniform triangular meshes without shrinkage and serious distortion. ...
Further, we apply this smoothing technique to a multiresolution representation to remove arbitrary levels of detail. ...
Acknowledgement We appreciate the anonymous reviewers for their valuable comments. ...
doi:10.1111/1467-8659.00483
fatcat:5pclueffoncfdorukil34mzofa
« Previous
Showing results 1 — 15 out of 3,132 results