Results 261 to 270 of about 89,668 (297)

Simplification of Global‐Illumination Meshes

Computer Graphics Forum, 1996
AbstractWe present a methodfor simplifying the meshes produced as solutions to global illumination problems, reducing geometric complexity while retaining the perceived imagefidelity. The method has been applied to produce meshes of linearly, quadratically and cubically colour‐interpolated triangles.
Merlin Hughes, Anselmo A. Lastra, Edward Saxe   +2 more
openaire   +1 more source

Mesh Simplification Using Hybrid Saliency

2016 International Conference on Cyberworlds (CW), 2016
This research presents a view-independent saliency model, which takes the effect of both color information and geometric information into account. The proposed method can simplify a mesh by dropping low-attention places while protecting the high-attention places.
Guangming An, Taichi Watanabe, Masanori Kakimoto   +2 more
openaire   +1 more source

Interest Points Guided Mesh Simplification

Applied Mechanics and Materials, 2012
Based on interest point detection, a feature preserving mesh simplification algorithm is proposed. The Harris operator values of all vertices in the mesh were computed firstly. On the base of Garland’s simplification algorithm, we combine the Harris operator value with quadric error metric and change the order of edge collapsing in the simplification ...
Ying Gao, Rui Zhao Wang, Jue Yuan
openaire   +1 more source

Mesh simplification for building typification

International Journal of Geographical Information Science, 2007
This paper describes an approach for the typification of buildings using a mesh-simplification technique. The approach is adapted from the area of computer graphics and was originally developed for surface reconstruction and mesh simplification. The main goal was to develop an algorithm which creates fast and reproducible results.
Burghardt, D, Cecconi, A
openaire   +2 more sources

An Efficient Mesh Simplification Algorithm

2009 Fourth International Conference on Internet Computing for Science and Engineering, 2009
This paper presents a new mesh simplification algorithm based on edge collapse, it combines surface curvature and quadric error metric, the position of a new vertex for edge collapse depends on multiple-weighted approach. The new algorithm can improve simplification rationality in procedure and preserve important features after simplification.
Hailing Wang, Guisheng Yin, Jing Zhang, Decai Wang, Jian Wang   +4 more
openaire   +1 more source

Neural Mesh Simplification

2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022
Rolandos Alexandros Potamias, Stylianos Ploumpis, Stefanos Zafeiriou   +2 more
openaire   +1 more source

Mesh Simplification with Vertex Color

2008
In a resource-constrained computing environment, it is essential to simplify complex meshes of a huge 3D model for visualization, storing and transmission. Over the past few decades, quadric error metric (QEM) has been the most popular error evaluation method for mesh simplification because of its fast computation time and good quality of approximation.
Hyun Soo Kim, Han Kyun Choi, Kwan H. Lee
openaire   +1 more source

Simplification of Nonconvex Tetrahedral Meshes

2003
The simplification of nonconvex tetrahedral meshes with the help of edge collapses (edge contractions) is considerably more complex than the corresponding simplification of convex meshes. In particular, edge collapses in nonconvex meshes may cause intersections of cells that are hard to detect, and therefore hard to avoid.
Martin Kraus, Thomas Ertl
openaire   +1 more source

Simplification Algorithm for General Meshes

2012 Fifth International Joint Conference on Computational Sciences and Optimization, 2012
A new mesh simplification framework based on the i®simplex collapse', which can produce approximations of simplified complexes of any type of meshes embedded in three dimensional Euclidean spaces, such as triangular meshes, quadrangular meshes, tetrahedral meshes, hexahedral meshes, and mixed complexes was presented in this paper.
openaire   +1 more source

Mesh Simplification Algorithm Based on N-Edge Mesh Collapse

2006
This paper presents a method for dividing the triangle mesh into n-edge mesh and puts forward a new mesh simplification algorithm based on n-edge mesh collapse. An n-edge mesh can be in the form of an edge, a triangle or a quadrangle, it depends on the value of ‘n’.
Hua-hong Chen, Xiao-nan Luo, Ruo-tian Ling   +2 more
openaire   +1 more source