1879 search results - page 196 / 376 » Computational geometry algorithms library |
147
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
145
click to vote
VISUALIZATION
2000
IEEE
15 years 10 months ago
2000
IEEE
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique,...
195
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
164
click to vote
DAC
2010
ACM
15 years 9 months ago
2010
ACM
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
152
click to vote
ACCV
2009
Springer
16 years 3 days ago
2009
Springer
We propose a new robust focal length estimation method in multi-view structure from motion from unordered data sets, e.g. downloaded from the Flickr database, where jpeg-exif heade...