
VolumeEnclosing Surface Extraction
In this paper we present a new method, which allows for the construction...
read it

PAVEL: Decorative Patterns with Packed Volumetric Elements
Many realworld handcrafted objects are decorated with elements that ar...
read it

A Marching Cube Algorithm Based on Edge Growth
Marching Cube algorithm is currently one of the most popular 3D reconstr...
read it

STEVE  SpaceTimeEnclosing Volume Extraction
The novel STEVE (i.e., SpaceTimeEnclosing Volume Extraction) algorithm...
read it

GPU Programming  Speeding Up the 3D Surface Generator VESTA
The novel "VolumeEnclosing Surface exTraction Algorithm" (VESTA) genera...
read it

Computation of Circular Area and Spherical Volume Invariants via Boundary Integrals
We show how to compute the circular area invariant of planar curves, and...
read it

Computer visionbased recognition of liquid surfaces and phase boundaries in transparent vessels, with emphasis on chemistry applications
The ability to recognize the liquid surface and the liquid level in tran...
read it
Speeding Up the 3D Surface Generator VESTA
The very recent volumeenclosing surface extraction algorithm, VESTA, is revisited. VESTA is used to determine implicit surfaces that are potentially contained in 3D data sets, such as 3D image data and/or 3D simulation data. VESTA surfaces are nondegenerate, i.e., they always enclose a volume that is larger than zero and they never selfintersect, prior to a further processing, e.g., towards isosurfaces. In addition to its ability to deal with local cell ambiguities consistently  and thereby avoiding the accidental generation of holes in the final surfaces  the information of the interior and/or exterior of enclosed 3D volumes is propagated correctly to each of the final surface tiles. Particular emphasis is put here on the speed up of the original formulation of VESTA, while applying the algorithm to 2x2x2 voxel neighborhoods.
READ FULL TEXT
Comments
There are no comments yet.