Sciweavers

6393 search results - page 225 / 1279
» Randomized Algorithms on the Mesh
Sort
View
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
15 years 6 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
CORR
2004
Springer
83views Education» more  CORR 2004»
15 years 6 months ago
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
Guy Melançon, Fabrice Philippe
COLOGNETWENTE
2010
15 years 5 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
ICIP
2002
IEEE
16 years 8 months ago
Real-time reconstruction of wavelet encoded meshes for view-dependent transmission and visualization
Wavelet methods for geometry encoding is a recently emerged superset of multiresolution analysis which has proven to be very efficient in term of compression and adaptive transmis...
Patrick Gioia, Oliver Aubault, Christian Bouville
SIGGRAPH
1996
ACM
15 years 10 months ago
Fitting Smooth Surfaces to Dense Polygon Meshes
Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models. In this paper, we present an algorithm and syst...
Venkat Krishnamurthy, Marc Levoy