18 research outputs found
FrameNet: Learning Local Canonical Frames of 3D Surfaces from a Single RGB Image
In this work, we introduce the novel problem of identifying dense canonical
3D coordinate frames from a single RGB image. We observe that each pixel in an
image corresponds to a surface in the underlying 3D geometry, where a canonical
frame can be identified as represented by three orthogonal axes, one along its
normal direction and two in its tangent plane. We propose an algorithm to
predict these axes from RGB. Our first insight is that canonical frames
computed automatically with recently introduced direction field synthesis
methods can provide training data for the task. Our second insight is that
networks designed for surface normal prediction provide better results when
trained jointly to predict canonical frames, and even better when trained to
also predict 2D projections of canonical frames. We conjecture this is because
projections of canonical tangent directions often align with local gradients in
images, and because those directions are tightly linked to 3D canonical frames
through projective geometry and orthogonality constraints. In our experiments,
we find that our method predicts 3D canonical frames that can be used in
applications ranging from surface normal estimation, feature matching, and
augmented reality
ACM Transactions on Graphics
We present FlexMolds, a novel computational approach to automatically design flexible, reusable molds that, once 3D printed, allow us to physically fabricate, by means of liquid casting, multiple copies of complex shapes with rich surface details and complex topology. The approach to design such flexible molds is based on a greedy bottom-up search of possible cuts over an object, evaluating for each possible cut the feasibility of the resulting mold. We use a dynamic simulation approach to evaluate candidate molds, providing a heuristic to generate forces that are able to open, detach, and remove a complex mold from the object it surrounds. We have tested the approach with a number of objects with nontrivial shapes and topologies
Génération de maillage quadrangulaire d'un domaine du plan via les équations de Ginzburg-Landau
National audienceGénérer un maillage d'une surface est un pré-requis souvent indispensable à de nombreuses applications. Certaines (la subdivision de surfaces, la simulation de couches limites) nécessitent l'utilisation de maillage quadrangulaire. L'état de l'art procède en trois étapes. Il s'agit d'abord de calculer un champ de croix, puis de l'intégrer pour obtenir une paramétrisation et enfin d'extraire un maillage quadrangulaire à partir de la paramétrisation. Nous montrerons que les deux premières étapes réfèrent aux mêmes équations et peuvent donc être traitées de la même manière. Cette approche permet de résoudre des problèmes (imprécision loin des bords, mauvaise localisation des singularités) qui se posaient jusqu'alors
Unstructured and semi-structured hexahedral mesh generation methods
Discretization techniques such as the finite element method, the finite volume method or the discontinuous Galerkin method are the most used simulation techniques in ap- plied sciences and technology. These methods rely on a spatial discretization adapted to the geometry and to the prescribed distribution of element size. Several fast and robust algorithms have been developed to generate triangular and tetrahedral meshes. In these methods local connectivity modifications are a crucial step. Nevertheless, in hexahedral meshes the connectivity modifications propagate through the mesh. In this sense, hexahedral meshes are more constrained and therefore, more difficult to gener- ate. However, in many applications such as boundary layers in computational fluid dy- namics or composite material in structural analysis hexahedral meshes are preferred. In this work we present a survey of developed methods for generating structured and unstructured hexahedral meshes.Peer ReviewedPostprint (published version
Global parametrization based on Ginzburg-Landau functional
International audienceQuad meshing is a fundamental preprocessing task for many applications (subdivision surfaces, boundary layer simulation). State-of-the-art quad mesh generators proceed in three steps: first a guiding cross field is computed, then a parametrization representing the quads is generated, and finally a mesh is extracted from the parameterization. In this paper we show that in the case of a periodic global parameterization two first steps answer to the same equation and inherently face the same challenges. This new insight allows us to use recent cross field generation algorithms based on Ginzburg-Landau equations to accurately solve the parametrization step. We provide practical evidence that this formulation enables us to overcome common shortcomings in parametrization computation (inaccuracy away from the boundary, singular dipole placement)