426 search results - page 55 / 86 » Run lengths and liquidity |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
GRID
2004
Springer
14 years 3 months ago
2004
Springer
Computational grids are increasingly being deployed in campus environments to provide unified access to distributed and heterogeneous resources such as clusters, storage arrays, ...
STACS
2004
Springer
14 years 3 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
PG
2003
IEEE
14 years 3 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...