(SIGGRAPH 2008)
(SGP 2007)
(SGP 2007)
(SGP 2006)
(SGP 2005)
(SIGGRAPH 2004)
|
|
This work introduces a new tool for solving the large linear systems arising
from gradient-domain image processing. It develops a streaming multigrid solver,
which needs just two sequential passes over out-of-core data. The resulting
system can solve the huge linear systems associated with performing stitching and
tone-mapping on gigapixel images while maintaining a small in-core memory footprint.
Due to its fast convergence and excellent cache behavior, the streaming solver is also
efficient for in-memory images.
(SIGGRAPH 2008) |
|
|
This work describes an out-of-core method for performing Poisson
surface reconstruction. We introduce a novel multilevel streaming octree
representation that enables solving the global reconstruction problem by
performing only three passes through the data. Since each pass only requires
that local data is maintained in core, our approach provides a method for
reconstructing surfaces when the initial point set, the output mesh, and the
intermediate data structures are themselves too large to fit into working
memory.
(SGP 2007) |
|
|
This work describes a method for extracting a watertight surfaces from an
octree representation of an implicit function. Using the topology of the
octree to define a set of binary edge-tree, the work shows that
inconsistencies due to depth disparities between adjacent leaf nodes can
be resolved, and a watertight isosurface can be extracted without restricting
either the topology or the values associated to the octree.
(SGP 2007) |
|
|
This work describes a method for reconstructing water-tight surfaces from an
input of oriented points. It shows that the surface reconstruction
algorithm presented by the FFT method can be exressed as a solution to a Poisson
equation. Thus, by adapting an octree to the point set and solving the Poisson
equation on the octree (rather than on a regular voxel grid) the algorithm provides
a method for reconstructing much higher resolution models without incurring the
prohibitive memory overhead exhibited by prior methods.
(SGP 2006) |
|
|
This work describes a method for reconstructing water-tight surfaces from an
input of oriented points. The method reduces the problem of surface reconstruction
to convolution, and provides an efficient method for reconstruction that reduces
the reconstruction process to three simple steps: (1) splatting the oriented points
into a voxel grid, (2) efficiently convolving with a fixed filter using the FFT, and
(3) extracting an iso-surface use marching cubes. The additive nature of the reconstruction
makes it stable in the presence of noise, and a simple heuristic allows to work well
when the points are non-uniformly distributed.
(SGP 2005) |
|
|
This work describes an iterative method for transforming anisotropic
models (models whose surface point variance is a function of direction) into
isotropic models (models whose covariance matrix is a constant multiple of
the identity matrix). The SIGGRAPH '04 paper describes applications of
anisotropic factorization to the domain of shape matching, where classes of
models that vary across anisotropy are difficult to match, due to the fact
that often the wrong correspondences are established between points on the
two surfaces.
(SIGGRAPH 2004) |