Sciweavers

1604 search results - page 17 / 321
» Approximation algorithms for developable surfaces
Sort
View
CGI
2004
IEEE
13 years 11 months ago
Computing Polygonal Surfaces from Unions of Balls
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
Roger C. Tam, Wolfgang Heidrich
SIGGRAPH
1998
ACM
13 years 11 months ago
A New Voronoi-based Surface Reconstruction Algorithm
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
Nina Amenta, Marshall W. Bern, Manolis Kamvysselis
QEST
2005
IEEE
14 years 1 months ago
An approximation algorithm for labelled Markov processes: towards realistic approximation
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
Alexandre Bouchard-Côté, Norm Ferns, ...
NCA
2007
IEEE
13 years 7 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
VISUALIZATION
1999
IEEE
13 years 12 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel