2601 search results - page 109 / 521 » A Point in Many Triangles |
DBPL
1989
Springer
14 years 2 months ago
1989
Springer
Several proposals have been published in recent years for database programming languages (DBPLs), many of which have been object-oriented. Our goal in this paper is not to argue f...
ICDE
2009
IEEE
14 years 12 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
COMPGEOM
2007
ACM
14 years 8 hour ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...