A Generalized Graph-Theoretic Mesh Optimization Model

نویسنده

  • Andrey A. Mezentsev
چکیده

This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lumped parameters, governed by the Kirchhoff’s voltage and circuit laws. Each mesh element is treated as a multi-pole electric component, relating input electric potentials to the output via a transfer function. We automatically derive an element transfer function and finally a mesh optimization model using a formal analysis of the coefficients couplings in the finite element stiffness matrix, similar to the method, used in Algebraic Multigrid. Our mesh model is a transient dynamic system and proposed optimization can be also used for mesh deformation problems. We will show that new method works well for realistic 3D meshes and provide a number of mesh optimization examples and details of our implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on a supergraph of the comaximal ideal graph of a commutative ring

Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...

متن کامل

Some results on the complement of a new graph associated to a commutative ring

The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...

متن کامل

Dynamic Programming in a Generalized Decision Model

We present two dynamic programming strategies for a general class of decision processes. Each of these algorithms includes among others the following graph theoretic optimization algorithms as special cases: the Ford-Bellman Strategy for optimal paths in acyclic digraphs, the Greedy Method for optimal forests and spanning trees in undirected graphs. In our general decision model, we deene sever...

متن کامل

Graph-Theoretic Solutions to Computational Geometry Problems

Many problems in computational geometry are not stated in graphtheoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, ...

متن کامل

THROUGHPUT OPTIMIZATION OF URBAN WIRELESS MESH NETWORKS by

Interference and collisions greatly limit the throughput of mesh networks that used contention-based MAC protocols such as 802.11. It is widely believed that significantly higher throughput is achievable if transmissions are scheduled. However, since the typical approach to this throughput optimization requires optimizing over a space that is exponential in the number of links, the optimal thro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004