329 search results - page 5 / 66 » On Range Searching with Semialgebraic Sets |
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
COMPGEOM
2003
ACM
14 years 1 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...
P2P
2005
IEEE
14 years 2 months ago
2005
IEEE
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
GMP
2000
IEEE
14 years 29 days ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
JCO
1998
13 years 8 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...