876 search results - page 57 / 176 » Complexity in geometric SINR |
SGP
2004
13 years 10 months ago
2004
In this paper, we initiate a study of shape description and classification via the application of persistent homology to tangential constructions on geometric objects. Our techniq...
ISPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
We are presenting techniques for simulating the motion and the deformation of cloth, fabrics or, more generally, deformable surfaces. Our main goal is to be able to simulate any k...
JMMA
2002
13 years 7 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...