45 search results - page 3 / 9 » compgeom 2006 |
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
I present an algorithm that can provably eliminate slivers in the interior of a tetrahedral mesh, leaving only tetrahedra with dihedral angles between 30 and 135 degrees and radiu...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides,...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...