6393 search results - page 197 / 1279 » Randomized Algorithms on the Mesh |
134
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
138
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
COCO
2005
Springer
15 years 9 months ago
2005
Springer
149
Voted
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...