apport de rechercheUnité de recherche INRIA Rhône-Alpes All-Purpose Texture Sprites (2009)
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret, Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret, ...
Abstract: We propose a representation for efficiently and conveniently storing texture patches on surfaces without parameterization. The main purpose is to texture surfaces at very high resolution...
Incremental construction of the Delaunay graph in medium dimension (2009)
Boissonnat, Jean-Daniel, Devillers, Olivier, Hornus, Samuel
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is...
Incremental construction of the Delaunay graph in medium dimension (2009)
Boissonnat, Jean-Daniel, Devillers, Olivier, Hornus, Samuel
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is...
de recherche Automatic Cell-and-portal Decomposition (2008)
Sylvain Lefebvre, Samuel Hornus, Sylvain Lefebvre, Samuel Hornus
apport
+1 ZP+: Correct Z-pass Stencil Shadows (2008)
Samuel Hornus, Jared Hoberock, Sylvain Lefebvre, John Hart
z-pass z-fail zp+
Temporal logic queries The lattice of solutions Polynomial time algorithms Hardness results Conclusion
Abstract Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2008)
Olivier Devillers, Vida Dujmović, Hazel Everett, Samuel Hornus, Sue Whitesides
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. 1
An efficient implementation of Delaunay triangulations in medium dimensions (2008)
Hornus, Samuel, Boissonnat, Jean-Daniel
We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm...
An efficient implementation of Delaunay triangulations in medium dimensions (2008)
Hornus, Samuel, Boissonnat, Jean-Daniel
We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm...
Marie-paule Cani, Samuel Hornus
To remain an attractive model, skeleton-based implicit surfaces have to allow the design and display of shapes at interactive rates. This paper focuses on surfaces whose skeletons are graphs of...
Samuel Hornus, Alexis Angelidis, Marie-paule Cani, Levels Of Detail, Implicit Surfaces
To remain an attractive model, skeleton-based implicit surfaces have to allow the design and display of shapes at interactive rates. This paper focuses on surfaces whose skeletons are graphs of...
Farthest-Polygon Voronoi Diagrams (2007)
Cheong, Otfried, Everett, Hazel, Glisse, Marc, Gudmundsson, Joachim, Hornus, Samuel, Lazard, Sylvain, ...
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest...
Farthest-Polygon Voronoi Diagrams (2007)
Cheong, Otfried, Everett, Hazel, Glisse, Marc, Gudmundsson, Joachim, Hornus, Samuel, Lazard, Sylvain, ...
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2007)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Whitesides, Sue, Wismath, Steve
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2007)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Whitesides, Sue, Wismath, Steve
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves. In...
Farthest-Polygon Voronoi Diagrams ∗ (2007)
Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, ...
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest...
Maintenance de la visibilité d'un point mobile, et applications (2006)
The notion of visibility is central in computer graphics and computational geometry. A visibility computation amounts to determining the shape, or merely the existence of the set of segments in space...
Maintenance de la visibilité d'un point mobile, et applications (2006)
The notion of visibility is central in computer graphics and computational geometry. A visibility computation amounts to determining the shape, or merely the existence of the set of segments in space...
Maintenance de la visibilité d'un point mobile, et applications (2006)
The notion of visibility is central in computer graphics and computational geometry. A visibility computation amounts to determining the shape, or merely the existence of the set of segments in space...
Maintenance de la visibilité d'un point mobile, et applications (2006)
The notion of visibility is central in computer graphics and computational geometry. A visibility computation amounts to determining the shape, or merely the existence of the set of segments in space...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Whitesides, Sue, Wismath, Steve
Given a set of $n$ points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint $q$ and efficiently maintaining this ordering information as $q$...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Wismath, Steve, Whitesides, Sue
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves.
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Wismath, Steve, Whitesides, Sue
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves.
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Whitesides, Sue, Wismath, Steve
Given a set of $n$ points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint $q$ and efficiently maintaining this ordering information as $q$...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Whitesides, Sue, Wismath, Steve
Given a set of $n$ points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint $q$ and efficiently maintaining this ordering information as $q$...
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint (2005)
Devillers, Olivier, Dujmovic, Vida, Everett, Hazel, Hornus, Samuel, Wismath, Steve, Whitesides, Sue
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering information as q moves.
Texture Sprites: Texture Elements Splatted on Surfaces (2005)
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
The bottom line shows the texture patterns used (which are the only user defined textures stored in video memory). All these bunnies are rendered in one pass, in real-time, using our composite...
Maintaining visibility information of planar point sets with a moving viewpoint (2005)
Olivier Devillers, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismathk
Abstract Given a set of n points in the plane, we consider theproblem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this or-dering information as q...
All-Purpose Texture Sprites (2004)
Lefebvre, Sylvain, Hornus, Samuel, Neyret, Fabrice
We propose a representation for efficiently and conveniently storing texture patches on surfaces without parameterization. The main purpose is to texture surfaces at very high resolution while using...
All-Purpose Texture Sprites (2004)
Lefebvre, Sylvain, Hornus, Samuel, Neyret, Fabrice
We propose a representation for efficiently and conveniently storing texture patches on surfaces without parameterization. The main purpose is to texture surfaces at very high resolution while using...
All-Purpose Texture Sprites (2004)
Lefebvre, Sylvain, Hornus, Samuel, Neyret, Fabrice
We propose a representation for efficiently and conveniently storing texture patches on surfaces without parameterization. The main purpose is to texture surfaces at very high resolution while using...
Automatic Cell-and-portal Decomposition (2003)
Lefebvre, Sylvain, Hornus, Samuel
We present a method to automatically compute a decomposition of a polygonal scene into a simple cell-and-portal graph. The resulting cell-and-portal graph satisfies the following user-defined...
Automatic Cell-and-portal Decomposition (2003)
Lefebvre, Sylvain, Hornus, Samuel
We present a method to automatically compute a decomposition of a polygonal scene into a simple cell-and-portal graph. The resulting cell-and-portal graph satisfies the following user-defined...
Automatic Cell-and-portal Decomposition (2003)
Lefebvre, Sylvain, Hornus, Samuel
We present a method to automatically compute a decomposition of a polygonal scene into a simple cell-and-portal graph. The resulting cell-and-portal graph satisfies the following user-defined...