Sciweavers

6365 search results - page 1061 / 1273
» Fast Local Computation Algorithms
Sort
View
SGP
2007
15 years 9 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...
SGP
2003
15 years 8 months ago
Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces
3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align th...
Marco Attene, Bianca Falcidieno, Michela Spagnuolo...
UAI
1993
15 years 8 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
CG
2011
Springer
14 years 10 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 12 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
« Prev « First page 1061 / 1273 Last » Next »