Sciweavers

27 search results - page 5 / 6
» Efficient Generation of Triangle Strips from Triangulated Me...
Sort
View
CGF
2000
155views more  CGF 2000»
13 years 7 months ago
Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
M. Gopi, Shankar Krishnan, Cláudio T. Silva
SGP
2007
13 years 10 months ago
A streaming algorithm for surface reconstruction
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...
Rémi Allègre, Raphaëlle Chaine,...
CGF
1999
126views more  CGF 1999»
13 years 7 months ago
A Shrink Wrapping Approach to Remeshing Polygonal Surfaces
Due to their simplicity and flexibility, polygonal meshes are about to become the standard representation for surface geometry in computer graphics applications. Some algorithms i...
Leif Kobbelt, Jens Vorsatz, Ulf Labsik, Hans-Peter...
VISSYM
2004
13 years 8 months ago
Isosurface Computation Made Simple
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
Valerio Pascucci
SCA
2007
13 years 10 months ago
Liquid simulation on lattice-based tetrahedral meshes
We describe a method for animating incompressible liquids with detailed free surfaces. For each time step, semiLagrangian contouring computes a new fluid boundary (represented as ...
Nuttapong Chentanez, Bryan E. Feldman, Franç...