Search results for "Computer Graphics"
showing 10 items of 530 documents
Sensitivity analysis for discretized unilateral plane elasticity problem
1992
Abstract Numerical realization of optimal shape design problems requires gradient information which is used in minimization procedures. There are several possibilities for obtaining this information. Here we present a method, based on the use of the material derivative approach, applied to the finite element discretization of the problem. The advantage of this approach is that is gives the exact values of gradient and it can be very easily implemented on computers. We apply this method in the case of contact problems, where the situation is more involved compared with the case of elasticity problems with classical boundary conditions. We concentrate on a special choice of the cost functiona…
STUDY OF VOLUME VARIATION OF IMPLICIT OBJECTS
2006
We propose studying the variations of volume of implicit objects during an animation according to several points of view: choice of the function of density, variations of parameters such as the iso-value and the radius of influence for a given function, variations of the parameters inherent in a particular function. Modification of parameters of the function of density must be carried out with care. There are no rules concerning these variations. To avoid the non-monotonous variations, it is necessary to choose a function of density beforehand and study the intervals of variation of its parameters. A new discretization makes it possible to locate these variations for a later use in a proce…
A survey on handling computationally expensive multiobjective optimization problems using surrogates: non-nature inspired methods
2015
Computationally expensive multiobjective optimization problems arise, e.g. in many engineering applications, where several conflicting objectives are to be optimized simultaneously while satisfying constraints. In many cases, the lack of explicit mathematical formulas of the objectives and constraints may necessitate conducting computationally expensive and time-consuming experiments and/or simulations. As another challenge, these problems may have either convex or nonconvex or even disconnected Pareto frontier consisting of Pareto optimal solutions. Because of the existence of many such solutions, typically, a decision maker is required to select the most preferred one. In order to deal wi…
G1 rational blend interpolatory schemes: a comparative study
2012
Interpolation of triangular meshes is a subject of great interest in many computer graphics related applications, as, for example, gaming and realtime rendering. One of the main approaches to interpolate the positions and normals of the mesh vertices is the use of parametric triangular Bezier patches. As it is well known, any method aiming at constructing a parametric, tangent plane (G^1) continuous surface has to deal with the vertex consistency problem. In this article, we propose a comparison of three methods appeared in the nineties that use a particular technique called rational blend to avoid this problem. Together with these three methods we present a new scheme, a cubic Gregory patc…
Improving Computing Systems Automatic Multiobjective Optimization Through Meta-Optimization
2016
This paper presents the extension of framework for automatic design space exploration (FADSE) tool using a meta-optimization approach, which is used to improve the performance of design space exploration algorithms, by driving two different multiobjective meta-heuristics concurrently. More precisely, we selected two genetic multiobjective algorithms: 1) non-dominated sorting genetic algorithm-II and 2) strength Pareto evolutionary algorithm 2, that work together in order to improve both the solutions’ quality and the convergence speed. With the proposed improvements, we ran FADSE in order to optimize the hardware parameters’ values of the grid ALU processor (GAP) micro-architecture from a b…
Geometric constraint solving: The witness configuration method
2006
Geometric constraint solving is a key issue in CAD, CAM and PLM. The systems of geometric constraints are today studied and decomposed with graph-based methods, before their numerical resolution. However, graph-based methods can detect only the simplest (called structural) dependences between constraints; they cannot detect subtle dependences due to theorems. To overcome these limitations, this paper proposes a new method: the system is studied (with linear algebra tools) at a witness configuration, which is intuitively similar to the unknown one, and easy to compute.
Solving the pentahedron problem
2015
Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron…
Patch-Based Image Denoising Model for Mixed Gaussian Impulse Noise Using L1 Norm
2017
Image denoising is the classes of technique used to free the image form the noise. The noise in the image may be added during the observation process due to the improper setting of the camera lance, low-resolution camera, cheap, and low-quality sensors, etc. Noise in the image may also be added during the image restoration, image transmission through the transmission media. To obtain required information from image, image must be noise free, i.e., high-frequency details must be present in the image. There are number of applications where image denoising is needed such as remote location detection, computer vision, computer graphics, video surveillance, etc. In last two decades, numbers of m…
Part I Commentary 2: Visualization in School Mathematics Analyzed from Two Points of View
2018
Researchers on educational psychology and mathematics education have different approaches to visualization, but there are relevant links between them. The chapters in this book illustrate some of those links. The present text is a reflection, made with the mathematics education eyes, on some chapters in this book presenting educational psychology points of view.