Results 251 to 260 of about 5,773 (293)

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   +3 more sources

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 ...
M Attene, M Campen, L Kobbelt
openaire   +3 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, Kobbelt, Leif, Pauly, Mark, Alliez, Pierre, Lévy, Bruno   +4 more
openaire   +4 more sources

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

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, Jan Eric Kyprianidis, Marc Alexa   +2 more
openaire   +1 more source

Delaunay Triangular Meshes in Convex Polygons

SIAM Journal on Scientific and Statistical Computing, 1986
Es wird ein Algorithmus vorgestellt, der eine Triangularisierung eines gegebenen konvexen Polygons P erzeugt (dies ist ein Teilschritt für die Finite-Element-Triangularisierung eines komplexen polygonalen Bereichs). Im Inneren von P entsteht ein quasi-gleichmäßiges Dreiecksgitter der Größe h, die auf dem Rand von P liegenden Dreiecksseiten haben auf ...
openaire   +1 more source

A novel mesh saliency approximation for polygonal mesh segmentation

Multimedia Tools and Applications, 2017
To assist a great variety of applications including object recognition or shape matching, 3D scene analysis, view point selection, mesh simplification, segmentation, and 3D printing etc., the approximation of mesh or part saliency has been intensively studied in recent years.
Hung-Kuang Chen, Mu-Wei Li
openaire   +1 more source

Fracture generation on polygonal meshes using Voronoi polygons

ACM SIGGRAPH 2002 conference abstracts and applications, 2002
This sketch describes a way of generating realistic cracks and fragments to visually simulate brittle fracture on polygonal surfaces.
openaire   +1 more source

Decomposing polygon meshes for interactive applications

Proceedings of the 2001 symposium on Interactive 3D graphics, 2001
This paper discusses an efficient and effective framework to decompose polygon meshes into components. This is useful in various interactive graphics applications, such as, mesh editing, establishing correspondence between objects for morphing, computation of bounding volume hierarchy for collision detection and ray tracing. In this paper, we formalize
Xuetao Li, Tong Wing Woon, Tiow Seng Tan, Zhiyong Huang   +3 more
openaire   +1 more source