Results 251 to 260 of about 128,865 (293)

Triangular mesh intersection

The Visual Computer, 2004
This paper proposes an efficient algorithm for finding self-intersections of a triangular mesh. It is very important to restrict, as much as possible, when and where the basic triangle-to-triangle intersection (TTI) algorithm is applied by taking advantage of the geometry and topology of a triangular mesh.
openaire   +1 more source

Geometric Snakes for Triangular Meshes

Computer Graphics Forum, 2002
Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In spite of much research in computer vision, automatic feature detection even for images still remains a difficult problem. To avoid this difficulty, semi-automatic or interactive techniques for image
Lee, YJ, Lee, SY
openaire   +2 more sources

Curvatures estimation on triangular mesh

Journal of Zhejiang University-SCIENCE A, 2005
Given a triangular approximation of a smooth surface, the authors propose a method to estimate the normal and principal curvatures of the surface. The method proposed is claimed to be more accurate than previously available ones.
Dong, Chenshi, Wang, Guozhao
openaire   +1 more source

Does contraction preserve triangular meshes?

Numerical Algorithms, 1996
A triangular graph is a planar graph in which each face is a triangle, except possibly for the exterior face, and without articulation nodes. The embedding of a triangular graph in the plane is called a triangular mesh. The paper gives a necessary and sufficient condition saying for which graphs triangularity is preserved after some edge contraction.
Ciarlet, P. jun., Lamour, F.
openaire   +2 more sources

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

TRIDIF, A triangular mesh diffusion code

Journal of Computational Physics, 1981
Abstract A triangular mesh finite difference code designed to study time-dependent magnetic diffusion and eddy current problems is described. TRIDIF is an extension of an existing widely used steady-state magnet design code entitled PANDIRA. The modifications required for the standard PANDIRA difference equations are presented. Sample results include
openaire   +2 more sources

Directional Smoothing of Triangular Meshes

International Conference on Computer Graphics, Imaging and Visualization (CGIV'05), 2005
In this paper, we propose a so-called directional smoothing method based mean curvature flow. The selection of the diffusion direction is based on the descent of some energy functional. We show that the directional diffusion flow is volume-preserving.
null Huanxi Zhao, null Guoliang Xu
openaire   +1 more source

Metamorphosis of arbitrary triangular meshes

IEEE Computer Graphics and Applications, 2000
Three-dimensional metamorphosis (or morphing) establishes a smooth transition from a source object to a target object. The primary issue in 3D metamorphosis is to establish surface correspondence between the source and target objects, by which each point on the surface of the source object maps to a point on the surface of the target object.
T. Kanai, H. Suzuki, F. Kimura
openaire   +1 more source

SOLUTION-BASED MESH QUALITY INDICATORS FOR TRIANGULAR AND TETRAHEDRAL MESHES

International Journal of Computational Geometry & Applications, 2000
A new mesh quality measure for triangular and tetrahedral meshes is presented. This mesh quality measure is based both on geometrical and solution information and is derived by considering the error when linear triangular and tetrahedral elements are used to approximate a quadratic function.
openaire   +2 more sources

Smooth surface and triangular mesh

Proceedings of the seventh ACM symposium on Solid modeling and applications, 2002
Replacing a smooth surface with a triangular mesh (i.e., a polyedron) "close to it" leads to some errors. The geometric properties of the triangular mesh can be very different from the geometric properties of the smooth surface, even if both surfaces are very close from one another.
Jean-Marie Morvan, Boris Thibert
openaire   +1 more source