141 search results - page 16 / 29 » Self-improving Algorithms for Convex Hulls |
161
click to vote
CGF
2008
15 years 4 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
105
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
134
click to vote
DAM
2007
15 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
121
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
124
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...