Sciweavers

1879 search results - page 117 / 376
» Computational geometry algorithms library
Sort
View
PVM
1998
Springer
15 years 8 months ago
Load Balancing for Network Based Multi-threaded Applications
In this paper we present Lbs, a load-management-system for network based concurrent computing. The system is built on Pt-Pvm, a library based on the PVM system. Pt-Pvm provides mes...
Oliver Krone, Martin Raab, Béat Hirsbrunner
FOCS
2000
IEEE
15 years 8 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
121
Voted
SIGGRAPH
2000
ACM
15 years 8 months ago
Normal meshes
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offse...
Igor Guskov, Kiril Vidimce, Wim Sweldens, Peter Sc...
SIGGRAPH
1992
ACM
15 years 8 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 ...
AMC
2007
108views more  AMC 2007»
15 years 4 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh