876 search results - page 64 / 176 » Complexity in geometric SINR |
CGF
2011
12 years 11 months ago
2011
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
COMPGEOM
2010
ACM
14 years 22 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
COMPGEOM
2009
ACM
14 years 10 days ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
SIGGRAPH
2010
ACM
14 years 4 days ago
2010
ACM
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...