895 search results - page 110 / 179 » Approximate convex decomposition |
113
click to vote
ISVC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
GD
1998
Springer
15 years 2 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we are interested in non-negative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. Previous work has demonstrated the relevance of this cost functi...
WSCG
2004
14 years 11 months ago
2004
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...