Sciweavers

1450 search results - page 81 / 290
» Complexity of Inference in Graphical Models
Sort
View
COMPGEOM
2008
ACM
13 years 10 months ago
Delpsc: a delaunay mesher for piecewise smooth complexes
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
Tamal K. Dey, Joshua A. Levine
ICDAR
2007
IEEE
14 years 3 months ago
On Segmentation of Documents in Complex Scripts
Document image segmentation algorithms primarily aim at separating text and graphics in presence of complex layouts. However, for many non-Latin scripts, segmentation becomes a ch...
K. S. Kumar, S. Kumar, C. V. Jawahar
VISUALIZATION
2003
IEEE
14 years 2 months ago
Extraction of topologically simple isosurfaces from volume datasets
There are numerous algorithms in graphics and visualization whose performance is known to decay as the topological complexity of the input increases. On the other hand, the standa...
Andrzej Szymczak, James Vanderhyde
SIGGRAPH
1992
ACM
14 years 1 months ago
Surface reconstruction from unorganized points
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
EGH
2009
Springer
13 years 6 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens