Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Results of a strength-based optimisation of flexural hinge shapes are given. Both pre-defined and freeform parametric shapes are considered. By employing nonlinear parametric optimisation algorithms, shapes that are best suited for the desired applications ...
This thesis presents a methodology for the design optimization of hydraulic runner blades. The originality of the methodology comes from the geometric definition of the blade shapes, which uses parametric surfaces instead of a set of profiles. The main adv ...
We have developed an algorithm for the rigid-body registration of a CT volume to a set of C-arm images. The algorithm uses a gradient-based iterative minimization of a least-squares measure of dissimilarity between the C-arm images and projections of the C ...
We show how the theory of deformations of geometric structures (development and holonomy) applied to the case of piecewise flat surfaces leads to some interesting geometric structures on the moduli space of a punctured surface. ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
We address the problem of reconstructing scalar and vector functions from non-uniform data. The reconstruction problem is formulated as a minimization problem where the cost is a weighted sum of two terms. The first data term is the quadratic measure of go ...
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the “natural” spline basis function as generator for a shift-invariant function space; i.e., the tensor-product B-spli ...
This paper advocates an implicit-surface representation of generic 3--D surfaces to take advantage of occluding edges in a very robust way. This lets us exploit silhouette constraints in uncontrolled environments that may involve occlusions and changing or ...
In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...
The extraction of planar sections from volume images is the most commonly used technique for inspecting and visualizing anatomic structures. We propose to generalize the concept of planar section to the extraction of curved cross-sections (free form surfac ...
Institute of Electrical and Electronics Engineers Computer Society2003
