Pierre Alliez, Szymon Rusinkiewicz, A. Myles, T. Ni, J. Peters
Polyhedral meshes consisting of triangles, quads, and pentagons and polar configurations cover all major sampling and modeling scenarios. We give an algorithm for efficient local, parallel conversion...
Pierre Alliez, Szymon Rusinkiewicz, A. Myles, T. Ni, J. Peters
Polyhedral meshes consisting of triangles, quads, and pentagons and polar configurations cover all major sampling and modeling scenarios. We give an algorithm for efficient local, parallel conversion...
Motorcycle Graphs: Canonical Quad Mesh Partitioning (2009)
Pierre Alliez, Szymon Rusinkiewicz, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad...
Tournois, Jane, Wormser, Camille, Alliez, Pierre, Desbrun, Mathieu
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise smooth surfaces. Building upon recent theoretical and practical advances, our algorithm interleaves...
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed,...
Pierre Alliez, Szymon Rusinkiewicz, Volume Number, Ramsay Dyer, Hao Zhang, Torsten Möller
Wedevelopadaptivesamplingcriteriawhichguaranteeatopologicallyfaithfulmeshanddemonstrateanimprovementandsimplificationoverearlierresults,albeitrestrictedto2Dsurfaces.Thesesamplingcriteriaarebasedon...
Deformation-Driven Shape Correspondence (2009)
Pierre Alliez, Szymon Rusinkiewicz, H. Zhang, A. Sheffer, D. Cohen-or, Q. Zhou, ...
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistance, the performances...
Maximum Entropy Coordinates for Arbitrary Polytopes (2009)
Pierre Alliez, Szymon Rusinkiewicz, K. Hormann, N. Sukumar
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle’s vertices, and they provide a convenient way to linearly interpolate data...
Tournois, Jane, Wormser, Camille, Alliez, Pierre, Desbrun, Mathieu
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise smooth surfaces. Building upon recent theoretical and practical advances, our algorithm interleaves...
Tournois, Jane, Wormser, Camille, Alliez, Pierre, Desbrun, Mathieu
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise smooth surfaces. Building upon recent theoretical and practical advances, our algorithm interleaves...
Filtering Relocations on a Delaunay Triangulation (2009)
Tournois, Jane, Alliez, Pierre, Devillers, Olivier
Updating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option...
Filtering Relocations on a Delaunay Triangulation (2009)
Tournois, Jane, Alliez, Pierre, Devillers, Olivier
Updating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option...
Perturbing Slivers in 3D Delaunay Meshes (2009)
Tournois, Jane, Srinivasan, Rahul, Alliez, Pierre
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper...
Perturbing Slivers in 3D Delaunay Meshes (2009)
Tournois, Jane, Srinivasan, Rahul, Alliez, Pierre
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper...
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed,...
Informatik Und, Dr. Pierre Alliez, Prof Dr, Leif Kobbelt, ...
Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar.
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed,...
Jane Tournois, Pierre Alliez, Olivier Devillers
Summary. We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay...
Le-jeng Shiue, Pierre Alliez, Radu Ursu, Lutz Kettner
This document is a tutorial on how to get started with the polyhedron structure provided by CGAL, the Computational Geometry Algorithm Library. Assuming the reader to be familiar with the C++...
Figure 1: A brief overview of our remeshing process: The input surface patch (top left) is first parameterized; Then geometric quantities are computed over the parameterization and stored in several...
Principal Component Analysis in CGAL (2008)
Gupta, Ankit, Alliez, Pierre, Pion, Sylvain
Principal component analysis is a basic component of many geometric computing and processing algorithms. It is most commonly used on point sets, although applicable as well to sets of arbitrary...
Principal Component Analysis in CGAL (2008)
Gupta, Ankit, Alliez, Pierre, Pion, Sylvain
Principal component analysis is a basic component of many geometric computing and processing algorithms. It is most commonly used on point sets, although applicable as well to sets of arbitrary...
Spectral Conformal Parameterization (2008)
Mullen, Patrick, Tong, Yiying, Alliez, Pierre, Desbrun, Mathieu
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts due to positional...
Spectral Conformal Parameterization (2008)
Mullen, Patrick, Tong, Yiying, Alliez, Pierre, Desbrun, Mathieu
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts due to positional...
CGAL - the Computational Geometry Algorithms Library (2008)
Alliez, Pierre, Fabri, Andreas, Fogel, Efi
The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient,...
CGAL - the Computational Geometry Algorithms Library (2008)
Alliez, Pierre, Fabri, Andreas, Fogel, Efi
The CGAL Open Source Project provides easy access to efficient and reliable geometric algorithms in the form of a C++ library, offering geometric data structures and algorithms, which are efficient,...
Removing degeneracies by perturbing the problem or perturbing the world (2007)
Pierre Alliez, Olivier Devillers, Jack Snoeyink
We describe two problem-specic approaches to remove geometric degeneracies that we call perturbing the problem and perturbing the world. Using the example of Delaunay triangulation, we show that...
Andrei Khodakovsky, Pierre Alliez, Peter Schröder
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Pierre Alliez, Isotropic Surface Remeshing
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we...
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and more detailed,...
Andrei Khodakovsky, Pierre Alliez, Peter Schröder
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient encoding of intrinsic...
Andrei Khodakovsky, Pierre Alliez, Peter Schröder
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Francis Schmitt
Abstract In this paper we introduce an efficient view dependent refinement technique well-suited to adaptive visualization of 3D triangle meshes on a graphic terminal. Our main goal is the design of...
Pierre Alliez, Pierre Alliez, David Cohen-steiner, David Cohen-steiner, Olivier Devillers, Olivier Devillers, ...
apport de recherche
Pierre Alliez, Pierre Alliez, Olivier Devillers, Olivier Devillers, Jack Snoeyink, Jack Snoeyink, ...
Removing degeneracies by perturbing the
Geometric Modeling Based on Polygonal Meshes (2007)
Botsch, Mario, Pauly, Mark, Kobbelt, Leif, Alliez, Pierre, Lévy, Bruno, Bischoff, Stephan, ...
In the last years triangle meshes have become increasingly popular and are nowadays intensively used in many different areas of computer graphics and geometry processing. In classical CAGD irregular...
Geometric Modeling Based on Polygonal Meshes (2007)
Botsch, Mario, Pauly, Mark, Kobbelt, Leif, Alliez, Pierre, Lévy, Bruno, Bischoff, Stephan, ...
In the last years triangle meshes have become increasingly popular and are nowadays intensively used in many different areas of computer graphics and geometry processing. In classical CAGD irregular...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
Farthest Point Seeding for Placement of Streamlines (2006)
Mebarki, Abdelkrim, Alliez, Pierre, Devillers, Olivier
We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration...
Periodic Global Parameterization (2006)
Ray, Nicolas, Li, Wan Chiu, Lévy, Bruno, Sheffer, Alla, Alliez, Pierre
We present a new globally smooth parameterization method for triangulated surfaces of arbitrary topology. Given two orthogonal piecewise linear vector fields defined over the input mesh (typically...
Periodic Global Parameterization (2006)
Ray, Nicolas, Li, Wan Chiu, Lévy, Bruno, Sheffer, Alla, Alliez, Pierre
We present a new globally smooth parameterization method for triangulated surfaces of arbitrary topology. Given two orthogonal piecewise linear vector fields defined over the input mesh (typically...
Periodic Global Parameterization (2006)
Ray, Nicolas, Li, Wan Chiu, Lévy, Bruno, Sheffer, Alla, Alliez, Pierre
We present a new globally smooth parameterization method for triangulated surfaces of arbitrary topology. Given two orthogonal piecewise linear vector fields defined over the input mesh (typically...
Farthest Point Seeding for Placement of Streamlines (2006)
Mebarki, Abdelkrim, Alliez, Pierre, Devillers, Olivier
We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration...
Reconstruction with Voronoi Centered Radial Basis Functions (2006)
Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette
We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...
Reconstruction with Voronoi Centered Radial Basis Functions (2006)
Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette
We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...
Reconstruction with Voronoi Centered Radial Basis Functions (2006)
Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette
We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...
Reconstruction with Voronoi Centered Radial Basis Functions (2006)
Samozino, Marie, Alexa, Marc, Alliez, Pierre, Yvinec, Mariette
We consider the problem of reconstructing a surface from scattered points sampled on a physical shape. The sampled shape is approximated as the zero level set of a function. This function is defined...
Periodic global parameterization (2006)
Nicolas Ray, Wan Chiu Li, Bruno Lévy, Alla Sheffer, Pierre Alliez, Inria Geometrica
provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server
Variational tetrahedral meshing (2005)
Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu
In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...
Farthest Point Seeding for Placement of Streamlines (2005)
Mebarki, Abdelkrim, Alliez, Pierre, Devillers, Olivier
We propose a novel algorithm for placement of streamlines from two-dimensional steady vector or direction fields. Our method consists of placing one streamline at a time by numerical integration...
Variational Tetrahedral Meshing (2005)
Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu
In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...
Variational Tetrahedral Meshing (2005)
Alliez, Pierre, Cohen-Steiner, David, Yvinec, Mariette, Desbrun, Mathieu
In this paper, a novel Delaunay-based variational approach to isotropic tetrahedral meshing is presented. To achieve both robustness and efficiency, we minimize a simple mesh-dependent energy through...
A Tutorial on CGAL Polyhedron for Subdivision Algorithms (2005)
We give an overview of the tutorial for theCGAL:: Polyhedron 3 and its use in subdivision algorithms. The full tutorial and the accompanying source code are available
Variational Shape Approximation (2004)
Cohen-Steiner, David, Alliez, Pierre, Desbrun, Mathieu
Achieving efficiency in mesh processing often demands that overly verbose 3D datasets be reduced to more concise, yet faithful representations. Despite numerous applications ranging from geometry...
Variational Shape Approximation (2004)
Cohen-Steiner, David, Alliez, Pierre, Desbrun, Mathieu
Achieving efficiency in mesh processing often demands that overly verbose 3D datasets be reduced to more concise, yet faithful representations. Despite numerous applications ranging from geometry...
Variational Shape Approximation (2004)
Cohen-Steiner, David, Alliez, Pierre, Desbrun, Mathieu
Achieving efficiency in mesh processing often demands that overly verbose 3D datasets be reduced to more concise, yet faithful representations. Despite numerous applications ranging from geometry...
Recent Advances in Compression of 3D Meshes (2003)
Alliez, Pierre, Gotsman, Craig
3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Isotropic Remeshing of Surfaces: a Local Parameterization Approach (2003)
Surazhsky, Vitaly, Alliez, Pierre, Gotsman, Craig
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on a copy of the...
Anisotropic Polygonal Remeshing (2003)
Alliez, Pierre, Cohen-Steiner, David, Devillers, Olivier, Lévy, Bruno, Desbrun, Mathieu
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic of natural or man-made geometry. In particular, we use curvature directions to...
Recent Advances in Compression of 3D Meshes (2003)
Alliez, Pierre, Gotsman, Craig
3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Isotropic Remeshing of Surfaces: a Local Parameterization Approach (2003)
Surazhsky, Vitaly, Alliez, Pierre, Gotsman, Craig
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on a copy of the...
Anisotropic Polygonal Remeshing (2003)
Alliez, Pierre, Cohen-Steiner, David, Devillers, Olivier, Lévy, Bruno, Desbrun, Mathieu
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic of natural or man-made geometry. In particular, we use curvature directions to...
Recent Advances in Compression of 3D Meshes (2003)
Alliez, Pierre, Gotsman, Craig
3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Isotropic Remeshing of Surfaces: a Local Parameterization Approach (2003)
Surazhsky, Vitaly, Alliez, Pierre, Gotsman, Craig
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on a copy of the...
Anisotropic Polygonal Remeshing (2003)
Alliez, Pierre, Cohen-Steiner, David, Devillers, Olivier, Lévy, Bruno, Desbrun, Mathieu
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic of natural or man-made geometry. In particular, we use curvature directions to...
Anisotropic Polygonal Remeshing (2003)
Alliez, Pierre, Cohen-Steiner, David, Devillers, Olivier, Lévy, Bruno, Desbrun, Mathieu
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic anisotropy of natural or man-made geometry. In particular, we use curvature...
Anisotropic Polygonal Remeshing (2003)
Alliez, Pierre, Cohen-Steiner, David, Devillers, Olivier, Lévy, Bruno, Desbrun, Mathieu
In this paper, we propose a novel polygonal remeshing technique that exploits a key aspect of surfaces: the intrinsic anisotropy of natural or man-made geometry. In particular, we use curvature...
Isotropic remeshing of surfaces: a local parameterization approach (2003)
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on a copy of the...
Recent advances in compression of 3D meshes (2003)
Summary. 3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Recent advances in compression of 3D meshes (2003)
3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Recent advances in compression of 3D meshes (2003)
Summary. 3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space....
Recent Advances in Compression of 3D Meshes Pierre Alliez (2003)
And Craig Gotsman, Pierre Alliez, Craig Gotsman
this paper we survey recent developments in compression of 3D surface meshes. We survey the main ideas and intuition behind techniques for single-rate and progressive mesh coding. Where possible, we...
Isotropic Surface Remeshing (2003)
Alliez, Pierre, Colin De Verdière, Éric, Devillers, Olivier, Isenburg, Martin
This paper proposes a new method for isotropic remeshing of tri- angulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it,...
Isotropic Surface Remeshing (2003)
Alliez, Pierre, Colin De Verdière, Éric, Devillers, Olivier, Isenburg, Martin
This paper proposes a new method for isotropic remeshing of tri- angulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it,...
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes (2002)
Khodakovsky, Andrei, Alliez, Pierre, Desbrun, Mathieu, Schröder, Peter
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Angle-Analyzer: A Triangle-Quad Mesh Codec (2002)
Lee, Haeyoung, Alliez, Pierre, Desbrun, Mathieu
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient encoding of intrinsic...
Isotropic Surface Remeshing (2002)
Alliez, Pierre, Colin De Verdière, Éric, Devillers, Olivier, Isenburg, Martin
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we...
Efficient Surface Remeshing by Error Diffusion (2002)
Alliez, Pierre, Desbrun, Mathieu, Meyer, Mark
We present a novel technique, both flexible and efficient, for interactive remeshing of irregular geometry. First, the original (arbitrary genus) mesh is substituted by a series of 2D maps in...
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes (2002)
Khodakovsky, Andrei, Alliez, Pierre, Desbrun, Mathieu, Schröder, Peter
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Angle-Analyzer: A Triangle-Quad Mesh Codec (2002)
Lee, Haeyoung, Alliez, Pierre, Desbrun, Mathieu
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient encoding of intrinsic...
Isotropic Surface Remeshing (2002)
Alliez, Pierre, Colin De Verdière, Éric, Devillers, Olivier, Isenburg, Martin
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we...
Efficient Surface Remeshing by Error Diffusion (2002)
Alliez, Pierre, Desbrun, Mathieu, Meyer, Mark
We present a novel technique, both flexible and efficient, for interactive remeshing of irregular geometry. First, the original (arbitrary genus) mesh is substituted by a series of 2D maps in...
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes (2002)
Khodakovsky, Andrei, Alliez, Pierre, Desbrun, Mathieu, Schröder, Peter
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Angle-Analyzer: A Triangle-Quad Mesh Codec (2002)
Lee, Haeyoung, Alliez, Pierre, Desbrun, Mathieu
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient encoding of intrinsic...
Isotropic Surface Remeshing (2002)
Alliez, Pierre, Colin De Verdière, Éric, Devillers, Olivier, Isenburg, Martin
This paper proposes a new method for isotropic remeshing of triangulated surface meshes. Given a triangulated surface mesh to be resampled and a user-specified density function defined over it, we...
Efficient Surface Remeshing by Error Diffusion (2002)
Alliez, Pierre, Desbrun, Mathieu, Meyer, Mark
We present a novel technique, both flexible and efficient, for interactive remeshing of irregular geometry. First, the original (arbitrary genus) mesh is substituted by a series of 2D maps in...
Compressing hexahedral volume meshes (2002)
Martin Isenburg, Pierre Alliez
Unstructured hexahedral volume meshes are of particular interest for visualization and simulation applications. They allow regular tiling of the three-dimensional space and show good numerical...
Compressing hexahedral volume meshes (2002)
Martin Isenburg, Pierre Alliez
Unstructured hexahedral volume meshes are of particular interest for visualization and simulation applications. They allow regular tiling of the three-dimensional space and show good numerical...
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes (2002)
Andrei Khodakovsky, Pierre Alliez
Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a...
Compressing hexahedral volume meshes (2002)
Martin Isenburg, Pierre Alliez
Unstructured hexahedral volume meshes are of particular interest for visualization and simulation applications. They allow regular tiling of the three-dimensional space and show good numerical...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
La réalité virtuelle représente aujourd'hui une technologie à part entière puisqu'elle autorise la simulation, la navigation et l'interaction avec un univers sensoriel synthétisé de toutes...
Removing degeneracies by perturbing the problem or perturbing the world (2000)
Alliez, Pierre, Devillers, Olivier, Snoeyink, Jack
We describe two problem-specific approaches to remove geometric degeneracies that we call perturbing the problem and perturbing the world. Using as our primary examples 2-d and 3-d Delaunay...
Removing degeneracies by perturbing the problem or perturbing the world (2000)
Alliez, Pierre, Devillers, Olivier, Snoeyink, Jack
We describe two problem-specific approaches to remove geometric degeneracies that we call perturbing the problem and perturbing the world. Using as our primary examples 2-d and 3-d Delaunay...
Mesh approximation using a volume-based metric (1999)
Pierre Alliez, Nathalie Laurent, Henri Sanson
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and the original mesh...
Removing Degeneracies by Perturbing the Problem or the World (1997)
Alliez, Pierre, Devillers, Olivier, Snoeyink, Jack
We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d...
Removing Degeneracies by Perturbing the Problem or the World (1997)
Alliez, Pierre, Devillers, Olivier, Snoeyink, Jack
We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d...
Removing Degeneracies by Perturbing the Problem or the World (1997)
Alliez, Pierre, Devillers, Olivier, Snoeyink, Jack
We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d...