498 search results - page 43 / 100 » Measuring the Complexity of Polygonal Objects |
BMCV
2000
Springer
14 years 3 months ago
2000
Springer
First IEEE International Workshop on Biologically Motivated Computer Vision, Seoul, Korea (May 2000). There is considerable evidence that object recognition in primates is based o...
NIPS
2007
14 years 13 days ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
IROS
2009
IEEE
14 years 5 months ago
2009
IEEE
— Many critical elements for statically stable walking for legged robots have been known for a long time, including stability criteria based on support polygons, good foothold se...
SI3D
2003
ACM
14 years 4 months ago
2003
ACM
This paper describes shear-image order ray casting, a new method for volume rendering. This method renders sampled data in three dimensions with image quality equivalent to the be...
CGF
2011
13 years 2 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...