Sciweavers

1458 search results - page 193 / 292
» Monads for incremental computing
Sort
View
CVPR
2010
IEEE
15 years 4 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 3 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
CAD
2010
Springer
15 years 3 months ago
Feature aligned quad dominant remeshing using iterative local updates
In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad-dominant mesh with edges well aligned to the principal directions of the underlying ...
Yu-Kun Lai, Leif Kobbelt, Shi-Min Hu
CGF
2008
135views more  CGF 2008»
15 years 3 months ago
Streaming Surface Reconstruction Using Wavelets
We present a streaming method for reconstructing surfaces from large data sets generated by a laser range scanner using wavelets. Wavelets provide a localized, multiresolution rep...
Josiah Manson, G. Petrova, Scott Schaefer
COMPUTING
2007
126views more  COMPUTING 2007»
15 years 3 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...