Sciweavers

1245 search results - page 122 / 249
» Triangulation for Points on Lines
Sort
View
SCA
2007
15 years 8 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ç...
BILDMED
2003
176views Algorithms» more  BILDMED 2003»
15 years 7 months ago
Volumetric Meshes for Real-Time Medical Simulations
We present an approach to generating volumetric meshes from closed triangulated surface meshes. The approach initially generates a structured hexahedral mesh based on the bounding ...
Matthias Müller, Matthias Teschner
CAD
2005
Springer
15 years 6 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
CGF
2007
98views more  CGF 2007»
15 years 6 months ago
Distance-Ranked Connectivity Compression of Triangle Meshes
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
Patrick Marais, James E. Gain, D. Shreiner
COMPGEOM
2005
ACM
15 years 8 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg