6 search results - page 1 / 2 » Transdichotomous Results in Computational Geometry, II: Offl... |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
CEC
2009
IEEE
14 years 5 months ago
2009
IEEE
— The application of on-line learning techniques to modern computer games is a promising research direction. In fact, they can be used to improve the game experience and to achie...
COMPGEOM
2000
ACM
14 years 3 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...