947 search results - page 184 / 190 » Discrete Geometry |
73
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
DGCI
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Human perception of shape is based on visual parts of objects to a point that a single, significant visual part is sufficient to recognize the whole object. For example,...