Results 261 to 270 of about 5,652 (312)

Polygon mesh repairing

ACM Computing Surveys, 2013
Nowadays, digital 3D models are in widespread and ubiquitous use, and each specific application dealing with 3D geometry has its own quality requirements that restrict the class of acceptable and supported models. This article analyzes typical defects that make a 3D model unsuitable for key application contexts, and surveys existing algorithms that ...
Marco Attene   +2 more
exaly   +4 more sources

Polygon Mesh Processing

N/A, 2010
Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models.
Botsch, Mario   +4 more
openaire   +4 more sources

Polygonal surface mesh optimization

Engineering with Computers, 2004
A procedure has been developed to improve polygonal surface mesh quality while maintaining the essential characteristics of the discrete surface. The surface characteristics are preserved by repositioning mesh vertices so that they remain on the original discrete surface.
Rao V. Garimella, Mikhail J. Shashkov
openaire   +1 more source

Polygonal and Polyhedral Delaunay Meshing

2021
We consider construction of a polyhedral Delaunay partition as a limit of the sequence of radical partitions (power diagrams), while the dual Voronoi diagram is obtained as a limit of sequence of weighted Delaunay partitions. Using a lifting analogy, this problem is reduced to the construction of a pair of dual convex polyhedra, inscribed and ...
Vladimir Garanzha, Liudmila Kudryavtseva
openaire   +1 more source

Untangling polygonal and polyhedral meshes via mesh optimization

Engineering with Computers, 2014
We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh.
Jibum Kim, Jaeyong Chung
openaire   +1 more source

Mesh Optimization for Polygonized Isosurfaces

Computer Graphics Forum, 2001
In this paper, we propose a method for improvement of isosurface polygonizations. Given an initial polygonization of an isosurface, we introduce a mesh evolution process initialized by the polygonization. The evolving mesh converges quickly to its limit mesh which provides with a high quality approximation of the isosurface even if the isosurface has ...
Yutaka Ohtake, Alexander G. Belyaev
openaire   +1 more source

Perfect Laplacians for Polygon Meshes

Computer Graphics Forum, 2015
AbstractA discrete Laplace‐Beltrami operator is called perfect if it possesses all the important properties of its smooth counterpart. It is known which triangle meshes admit perfect Laplace operators and how to fix any other mesh by changing the combinatorics.
Philipp Herholz   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy