Search results for "Polygon"
showing 10 items of 282 documents
MESH COMPARISON USING ATTRIBUTE DEVIATION METRIC
2004
We propose a mesh comparison method using a new attribute deviation metric. The considered meshes contain geometrical and appearance attributes (material color, texture, temperature, etc.). The proposed deviation metric computes local differences between the attributes of two meshes. A mesh comparison assessment can be done easily and quickly using this metric. The techniques proposed are applicable in a number of ways, e.g. 3D matching and registration, and the example described in the paper is the simplification of a surface by iteratively reducing its complexity according to an error metric. The results are presented showing the success of the algorithm through comparisons with other me…
Multiresolution Analysis for Irregular Meshes
2003
International audience; The concept of multiresolution analysis applied to irregular meshes has become more and more important. Previous contributions proposed a variety of methods using simplification and/or subdivision algorithms to build a mesh pyramid. In this paper, we propose a multiresolution analysis framework for irregular meshes with attributes. Our framework is based on simplification and subdivision algorithms to build a mesh pyramid. We introduce a surface relaxation operator that allows to build a non-uniform subdivision for a low computational cost. Furthermore, we generalize the relaxationoperator to attributes such as color, texture, temperature, etc. The attribute analysis…
A Certain Mathematical Model of the Glass Fibre Material Production
1997
There is considered the full mathematical model of chemical reactions on the surface of glass fibre material that was imbedded in the flow of acid solution and was pulled longitudionally. Self-similar forms of this model are obtained and their approximations by monotone schemes of differences are proposed. Some special cases which make possible to get the analytic solutions are underlined. The self-similar forms of the differential equations of the substances transport allow to calculate the emission of the alkaline oxide from the glass fibre material under the influence of the acid solution flow. Some conclusions with practical significance for the technological process is made up accordin…
Cost-driven framework for progressive compression of textured meshes
2019
International audience; Recent advances in digitization of geometry and radiometry generate in routine massive amounts of surface meshes with texture or color attributes. This large amount of data can be compressed using a progressive approach which provides at decoding low complexity levels of details (LoDs) that are continuously refined until retrieving the original model. The goal of such a progressive mesh compression algorithm is to improve the overall quality of the transmission for the user, by optimizing the rate-distortion trade-off. In this paper, we introduce a novel meaningful measure for the cost of a progressive transmission of a textured mesh by observing that the rate-distor…
Mesh connectivity compression using convection reconstruction
2007
International audience; During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first …
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems
1984
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding toGale, Farkas, Gordan andMotzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
Some classes of topological quasi *-algebras
2001
The completion $\overline{A}[\tau]$ of a locally convex *-algebra $A [ \tau ]$ with not jointly continuous multiplication is a *-vector space with partial multiplication $xy$ defined only for $x$ or $y \in A_{0}$, and it is called a topological quasi *-algebra. In this paper two classes of topological quasi *-algebras called strict CQ$^*$-algebras and HCQ$^*$-algebras are studied. Roughly speaking, a strict CQ$^*$-algebra (resp. HCQ$^*$-algebra) is a Banach (resp. Hilbert) quasi *-algebra containing a C$^*$-algebra endowed with another involution $\sharp$ and C$^*$-norm $\| \|_{\sharp}$. HCQ$^*$-algebras are closely related to left Hilbert algebras. We shall show that a Hilbert space is a H…
Relatively weakly open convex combinations of slices
2018
We show that c 0 c_0 and, in fact, C ( K ) C(K) for any scattered compact Hausdorff space K K have the property that finite convex combinations of slices of the unit ball are relatively weakly open.
Strongly extreme points and approximation properties
2017
We show that if $x$ is a strongly extreme point of a bounded closed convex subset of a Banach space and the identity has a geometrically and topologically good enough local approximation at $x$, then $x$ is already a denting point. It turns out that such an approximation of the identity exists at any strongly extreme point of the unit ball of a Banach space with the unconditional compact approximation property. We also prove that every Banach space with a Schauder basis can be equivalently renormed to satisfy the sufficient conditions mentioned. In contrast to the above results we also construct a non-symmetric norm on $c_0$ for which all points on the unit sphere are strongly extreme, but …