Results 1  10
of
519
Codirecteur de thèse: Prof. JeanMarie MORVAN
, 2013
"... dans le cadre de l’Ecole Doctorale InfoMaths ..."
Anisotropic Rectangular Metric For Polygonal Surface Remeshing
"... We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a userspecified normalbased tolerance error and the requirement to fa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a userspecified normalbased tolerance error and the requirement to favor rectangleshaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.
Isotropic 2d quadrangle meshing with size and orientation control
 In Proceedings of the International Meshing Roundtable
, 2011
"... Summary. We propose an approach for automatically generating isotropic 2D quadrangle meshes from arbitrary domains with a fine control over sizing and orientation of the elements. At the heart of our algorithm is an optimization procedure that, from a coarse initial tiling of the 2D domain, enforces ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Summary. We propose an approach for automatically generating isotropic 2D quadrangle meshes from arbitrary domains with a fine control over sizing and orientation of the elements. At the heart of our algorithm is an optimization procedure that, from a coarse initial tiling of the 2D domain, enforces each of the desirable mesh quality criteria (size, shape, orientation, degree, regularity) one at a time, in an order designed not to undo previous enhancements. Our experiments demonstrate how well our resulting quadrangle meshes conform to a wide range of input sizing and orientation fields. 1
Electrical Performances of AlInN/GaN HEMTs. A Comparison with AlGaN/GaN HEMTs with similar technological process
"... Electrical performances of AlInN/GaN HEMTs. A comparison with AlGaN/GaN HEMTs with similar technological process olivier jardel1, guillaume callet1,2, je’re’my dufraisse1,2, michele piazza1,2, nicolas sarazin1, eric chartier1, mourad oualli1, raphae¤l aubry1, tibault reveyrand2, jeanclaude jacquet1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
1, marieantoinette di forte poisson1, erwan morvan1, ste’phane piotrowicz1 and sylvain l. delage1 A study of the electrical performances of AlInN/GaN High Electron Mobility Transistors (HEMTs) on SiC substrates is presented in this paper. Four different wafers with different technological
Palavras Chave: 1. Affine Differential Geometry 2. Affine Curvature 3. Affine Length 4. Curve Reconstruction
"... points and tangents into parabolic polygons: ..."
ORIGINAL CLINICAL INVESTIGATION Open Access
"... Plateletdependent thrombography gives a distinct pattern of in vitro thrombin generation after surgery with cardiopulmonary bypass: potential implications Rose Said 1,2 † , Véronique Regnault 1,2 † , Marie Hacquard 1,3, JeanPierre Carteaux 1 and Thomas Lecompte 1,2,3,4* Background: Bleeding remai ..."
Abstract
 Add to MetaCart
Plateletdependent thrombography gives a distinct pattern of in vitro thrombin generation after surgery with cardiopulmonary bypass: potential implications Rose Said 1,2 † , Véronique Regnault 1,2 † , Marie Hacquard 1,3, JeanPierre Carteaux 1 and Thomas Lecompte 1,2,3,4* Background: Bleeding
Parabolic polygons and discrete affine geometry
 In 19th Brazilian Symposium on Computer Graphics and Image Processing
"... Abstract. Geometry processing applications estimate the local geometry of objects using information localized at points. They usually consider information about the normal as a side product of the points coordinates. This work proposes parabolic polygons as a model for discrete curves, which intrins ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. Geometry processing applications estimate the local geometry of objects using information localized at points. They usually consider information about the normal as a side product of the points coordinates. This work proposes parabolic polygons as a model for discrete curves, which intrinsically combines points and normals. This model is naturally affine invariant, which makes it particularly adapted to computer vision applications. This work introduces estimators for affine length and curvature on this discrete model and presents, as a proof–of–concept, an affine invariant curve reconstruction.
Smooth surface and triangular mesh : Comparison of the area, the normals and the unfolding
 In ACM Symposium on Solid Modeling and Applications
, 2001
"... Replacing a smooth surface with a triangular mesh (i.e., a polyedron) "close to it " leads to some errors. The geometric properties of the triangular mesh can be very dierent from the geometric properties of the smooth surface, even if both surfaces are very close from one another. In this ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Replacing a smooth surface with a triangular mesh (i.e., a polyedron) "close to it " leads to some errors. The geometric properties of the triangular mesh can be very dierent from the geometric properties of the smooth surface, even if both surfaces are very close from one another. In this paper, we give examples of \developable " triangular meshes (the discrete Gaussian curvature is equal to 0 at each interior vertex) inscribed in a sphere (whose Gaussian curvature is equal to 1 at every point). However, if we make assumptions on the geometry of the triangular mesh, on the curvature of the smooth surface and on the Hausdor distance between both surfaces, we get an estimate of several properties of the smooth surface in terms of the properties of the triangular mesh. In particular, we give explicit approximations of the normals and of the area of the smooth surface. Furthermore, if we suppose that the smooth surface is developable (i.e., "isometric " to a surface of the plane), we give an explicit approximation of the "unfolding " of this surface. Just notice that in some of our approximations, we do not suppose that the vertices of the triangular mesh belong to the smooth surface. Oddly, the upper bounds on the errors are better when triangles are rightangled (even if there are small angles): we do not need every angle of the triangular mesh to be quite large. We just need each triangle of the triangular mesh to contain at least one angle whose sine is large enough. Besides, approximations are better if the triangles of the triangular mesh are quite small where the smooth surface has a large curvature. Some proofs will be omitted.
ETUDE DE L’INFLUENCE DU REGIME D’UNE
, 2010
"... National de la Recherche du Luxembourg, et à l’apport des moyens techniques des deux laboratoires. La thèse s’est déroulée sous la direction du Pr. Farzaneh Arefi‐Khonsari, professeur à l’Université Pierre et Marie Curie. Les travaux ont également été encadrés par Patrick Choquet, chef de projet au ..."
Abstract
 Add to MetaCart
National de la Recherche du Luxembourg, et à l’apport des moyens techniques des deux laboratoires. La thèse s’est déroulée sous la direction du Pr. Farzaneh Arefi‐Khonsari, professeur à l’Université Pierre et Marie Curie. Les travaux ont également été encadrés par Patrick Choquet, chef de projet au
Symplectic aspects of the first eigenvalue
 J. Reine Angew. Math
, 1998
"... There are two themes in the present paper. The first one is spelled out in the title, and is inspired by an attempt to find an analogue of HerschYangYau estimate for λ1 of surfaces in symplectic category. In particular we prove that every split symplectic manifold T 4 × M admits a compatible Riema ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
There are two themes in the present paper. The first one is spelled out in the title, and is inspired by an attempt to find an analogue of HerschYangYau estimate for λ1 of surfaces in symplectic category. In particular we prove that every split symplectic manifold T 4 × M admits a compatible Riemannian metric whose first eigenvalue is arbitrary large. On the other hand for Kähler metrics compatible with a given integral symplectic form an upper bound for λ1 does exist. The second theme is the study of Hamiltonian symplectic fibrations over S 2. We construct a numerical invariant called the size of a fibration which arises as the solution of certain variational problems closely related to Hofer’s geometry, Karea and coupling. In some examples it can be computed with the use of GromovWitten invariants. The link between these two themes is given by an observation that the first eigenvalue of a Riemannian metric compatible with a symplectic fibration admits a universal upper bound in terms of the size. 1. Introduction and
Results 1  10
of
519