732 search results - page 115 / 147 » Surface And Deep Cases |
CAGD
2010
13 years 5 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
JMLR
2010
13 years 3 months ago
2010
We introduce a simple order-based greedy heuristic for learning discriminative structure within generative Bayesian network classifiers. We propose two methods for establishing an...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...