Results 251 to 260 of about 89,668 (297)
Some of the next articles are maybe not open access.
Computer Graphics Forum, 1996
AbstractMesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles.
Maria‐Elena Algorri, Francis Schmitt
openaire +1 more source
AbstractMesh simplification is an important stage after surface reconstruction since the models produced can contain a large number of polygons making them difficult to manipulate. In this paper we present a mesh simplification algorithm to reduce the number of vertices in a dense mesh of triangles.
Maria‐Elena Algorri, Francis Schmitt
openaire +1 more source
2011 International Conference on Computer and Management (CAMAN), 2011
This paper proposes a new mesh simplification algorithm which makes effort in reducing the approximation error and improving the mesh regularity of simplified mesh at the same time. In previous mesh simplification researches, algorithms generally focused on the appearance error between the simplified mesh and the original mesh.
Chien-Hsing Chiang +2 more
openaire +1 more source
This paper proposes a new mesh simplification algorithm which makes effort in reducing the approximation error and improving the mesh regularity of simplified mesh at the same time. In previous mesh simplification researches, algorithms generally focused on the appearance error between the simplified mesh and the original mesh.
Chien-Hsing Chiang +2 more
openaire +1 more source
Multilevel mesh simplification
The Visual Computer, 2013The goal of a multilevel simplification method is to produce different levels of refinement of a mesh, reducing the resolution (total number of faces), while preserving the original topology and a good approximation to the original geometry. A new approach to simplification based on the evolution of surfaces under p-Laplacian flow is presented. Such an
MORIGI, SERENA, M. Rucci
openaire +1 more source
User-assisted mesh simplification
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications, 2006During the last decade, many simplification methods have been proposed to generate multi-resolution meshes for real-time applications. Practitioners have found that these methods alone usually fail to produce satisfactory result when models of very low polygon count are desired.
Tan-Chi Ho +4 more
openaire +1 more source
Simplification of Articulated Meshes
Computer Graphics Forum, 2009AbstractWe present a method for simplifying a polygonal character with an associated skeletal deformation such that the simplified character approximates the original shape well when deformed. As input, we require a set of example poses that are representative of the types of deformations the character undergoes and we produce a multi‐resolution ...
Eric Landreneau, Scott Schaefer
openaire +1 more source
Simplification of hexahedral mesh
ACM SIGGRAPH 2012 Posters on - SIGGRAPH '12, 2012Mesh simplification is an important and difficult problem in pretreatment and post-processing of finite element analysis (FEA). Simplification of tetrahedral mesh has been studied deeply in the past two decades. However, although hexahedral mesh is widely used in FEA, there is almost no related work about its simplification method.
Pan Chao, Liu Zhenyu, Tan Jianrong
openaire +1 more source
Fast stellar mesh simplification
16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003), 2004We introduce stellar simplification, a fast implementation of the four-face cluster algorithm. In our version of this mesh simplification scheme, we adopt a probabilistic heuristic that substitutes the priority queue of the original algorithm. This made our version, on average, 40% faster.
A.W. Vieira +4 more
openaire +1 more source
Skeleton-bridged Mesh Saliency and Mesh Simplification
2020 4th International Conference on Computer Science and Artificial Intelligence, 2020This paper presents a local-to-global framework for mesh saliency, which can measure the visual importance in agreement with human perception. Firstly, based on Voronoi diagram, we give a new descriptor which does not only compute the local saliency, but also facilitates the computation of 3D skeleton and global saliency.
Wanna Luan, Chengming Liu, Haibo Pang
openaire +1 more source
Angle-bounded 2D mesh simplification
Computer Aided Geometric Design, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steffen Hinderink +2 more
openaire +1 more source
Large mesh simplification for distributed environments
Computers & Graphics, 2015An algorithm is described to simplify arbitrarily large triangle meshes while leveraging the computing power of modern distributed environments. Our method combines the flexibility of out-of-core (OOC) techniques with the quality of accurate in-core algorithms, while representing a particularly fast approach thanks to the concurrent use of several ...
D Cabiddu, M Attene
openaire +4 more sources