110 search results - page 12 / 22 » Minimal Partitions Of A Box Into Boxes |
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
CGF
2007
14 years 11 months ago
2007
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
108
click to vote
CSCW
2004
ACM
15 years 5 months ago
2004
ACM
Single Display Groupware (SDG) lets multiple co-located people, each with their own input device, interact simultaneously over a single communal display. While SDG is beneficial, ...
VRST
1997
ACM
15 years 4 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...