102 search results - page 17 / 21 » Improved Bounds for Geometric Permutations |
CAGD
2006
14 years 9 months ago
2006
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
CGF
2004
14 years 9 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...
SMA
2008
ACM
14 years 9 months ago
2008
ACM
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
SIAMCOMP
2010
14 years 4 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...