Results 221 to 230 of about 79,010 (265)

Mesh optimization

Proceedings of the 20th annual conference on Computer graphics and interactive techniques, 1993
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same topological type as M0, that fits the data well and has a small number of vertices.
Hugues Hoppe   +4 more
openaire   +1 more source

Optimized testing of meshes

Proceedings. International Test Conference 1990, 2002
Efficient testing techniques for two-dimensional mesh interconnection networks are presented. The tests cover faults in the data paths and the control circuitry, including faults in the arbitration logic of the switches. Testing for the resolution of the conflicts is important for ensuring the correct functioning of the interconnection network, since a
Miroslaw Malek, Banu Ă–zden
openaire   +1 more source

Square Meshes are not Always Optimal,

Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, 1988
Mesh-connected computers with multiple buses providing broadcast facilities along rows and columns are discussed. A tight bound of Theta (n/sup 1/8/) is established for the number of rounds required for semigroup computations on n values distributed on a two-dimensional rectangular mesh of size n with a bus on every row and column.
Amotz Bar-Noy, David Peleg
openaire   +1 more source

A multiobjective mesh optimization framework for mesh quality improvement and mesh untangling [PDF]

open access: yesInternational Journal for Numerical Methods in Engineering, 2013
SUMMARYWe propose a multiobjective mesh optimization framework for mesh quality improvement and mesh untangling. Our framework combines two or more competing objective functions into a single objective function to be solved using one of various multiobjective optimization methods. Methods within our framework are able to optimize various aspects of the
Jibum Kim, Suzanne M Shontz
exaly   +2 more sources

Optimal Coarsening of Unstructured Meshes

Journal of Algorithms, 1999
Summary: A bounded aspect-ratio coarsening sequence of an unstructured mesh \(M_0\) is a sequence of meshes \(M_1,\dots, M_k\) such that: \(M_i\) is bounded aspect-ratio mesh, and \(M_i\) is an approximation of \(M_{i-1}\) that has fewer elements, where a mesh is called a bounded aspect-ratio mesh if all its elements are of bounded aspect-ratio.
Gary L. Miller   +2 more
openaire   +2 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

Multiobjective variable mesh optimization

Annals of Operations Research, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yamisleydi Salgueiro   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy