947 search results - page 123 / 190 » Discrete Geometry |
COMPGEOM
2006
ACM
15 years 3 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
15 years 3 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
15 years 3 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 . ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a smoothly embedded 2-manifold in ¤¦¥ , we define the elevation of a point as the height difference to a canonically defined second point on the same manifold. Our de...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...