Results 1 to 10 of about 120,110 (318)
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes [PDF]
A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G.
Mustapha Kchikech, Olivier Togni
doaj +6 more sources
Quality improvement of surface triangular mesh using a modified Laplacian smoothing approach avoiding intersection. [PDF]
We present a systematic procedure to improve the qualities of triangular molecular surface meshes and at the same time preserve the manifoldness. The procedure utilizes an algorithm to remove redundant points having three or four valences and another ...
Tiantian Liu+4 more
doaj +2 more sources
Guaranteed-Quality Triangular Meshes [PDF]
There are a number of applications for which it is desirable to divide a given region in the plane into nicely shaped triangles. One important such application is the finite element method, a method widely used to obtain approximate solutions to a wide variety of engineering problems.
L. Paul Chew
openaire +4 more sources
Robust Spherical Parameterization of Triangular Meshes [PDF]
Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing. Closed, manifold, genus-0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them.
Craig Gotsman, Nira Dyn, Alla Sheffer
openaire +3 more sources
Hash function use for triangular mesh reconstruction [PDF]
Some applications use data formats (for example STL file format), where a set of triangles is used to represent a surface of an object and it is necessary to reconstruct the regular triangular mesh from such a data format for many applications. It is a lengthy process for large data sets as the time complexity of this process is O(N2) or O(N lgN ...
Skala, Václav+2 more
openaire +4 more sources
Sealed Decomposition of a Triangular Mesh with Tetrahedral Mesh Segmentation [PDF]
AbstractWe propose a method for decomposing a closed 2-manifold triangular mesh (tri-mesh) into a set of sub-meshes. This approach has two novel features. First, the decomposed tri-meshes are “sealed”. This type of subset tri-mesh generally has boundaries, but our method automatically fills these boundaries to close the subset mesh in a technique known
Hiromasa Suzuki+2 more
openaire +3 more sources
Fault-Tolerant Partition Resolvability in Mesh Related Networks and Applications
Fault-tolerance of a system measures its working capability in the presence of faulty components in the system. The fault-tolerant partition dimension of a network computes the least number of subcomponents of network required to distinctively identify ...
Kamran Azhar+4 more
doaj +1 more source
Deep Neural Network for 3D Shape Classification Based on Mesh Feature
Virtual reality, driverless cars, and robotics all make extensive use of 3D shape classification. One of the most popular ways to represent 3D data is with polygonal meshes. In particular, triangular mesh is frequently employed.
Mengran Gao+3 more
doaj +1 more source
This paper is an introduction to mesh based generated reluctance network modeling using triangular elements. Many contributions on mesh based generated reluctance networks using rectangular shaped elements have been published, but very few on those ...
Haidar Diab+4 more
doaj +1 more source
Triangular meshes play critical roles in many applications, such as numerical simulation and additive manufacturing. However, the triangular meshes transformed from computer-aided design models using common algorithms may have many undesirable narrow ...
Yu Huo+6 more
doaj +1 more source