19 search results - page 4 / 4 » The Ordinary Line Problem Revisited |
STACS
2010
Springer
14 years 9 days ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ICCV
2009
IEEE
13 years 3 months ago
2009
IEEE
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...