727 search results - page 5 / 146 » One line and n points |
SWAT
2004
Springer
14 years 4 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
MP
2008
13 years 10 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
JCDCG
2000
Springer
14 years 2 months ago
2000
Springer
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
ISVD
2007
IEEE
14 years 5 months ago
2007
IEEE
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
SODA
2008
ACM
14 years 9 days ago
2008
ACM
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....