Sciweavers

727 search results - page 31 / 146
» One line and n points
Sort
View
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
14 years 11 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
14 years 9 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 3 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
WPES
2004
ACM
15 years 3 months ago
Privacy preserving route planning
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
Keith B. Frikken, Mikhail J. Atallah
FOCS
1999
IEEE
15 years 2 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled