6393 search results - page 197 / 1279 » Randomized Algorithms on the Mesh |
177
click to vote
SODA
1997
ACM
15 years 7 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...
177
click to vote
SODA
2010
ACM
16 years 3 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...
193
click to vote
SIGGRAPH
1998
ACM
15 years 10 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...