## 抄録

Given a set S of n points in the plane and an angle θ, a set of b + 1 parallel lines l_{0},l_{1},…,l_{b} of slope θ (b is fixed) is called a θ-cut of S if l_{0},l_{1},…,l_{b} are equally spaced and all the points of S lie between l_{0} and l_{b}. The regions between two consecutive lines are called buckets. In this paper we consider the problem of finding an optimal θ-cut such that points are distributed into b buckets most uniformly, in other words, such that the maximum number of points to be included in one bucket is minimized. Comer and O’Donnell considered the problem under a constraint that l_{0} and l_{b} are two supporting lines of S and presented an algorithm which runs in O(bn^{2} log bn) time and O(n^{2} + bn) space. In this paper we present two linear-space algorithm for the problem based on duality transformation. One runs in O(n^{2} + K log n + bn) time, where K is the number of intersections in the transformed plane. It is shown that K = O(n^{2} + bn). The other is advantageous if b < √n and runs in O(b^{0.610}n^{1.695}+bn+K log n) time. Those are improvement of Comer and O’Donnell’s algorithm both in time and space complexities. We also show that our algorithm can be extended to the case of buckets in the form of two-dimensional arrays. Then, we extend our algorithm so as to solve the unconstrained version of the problem (l_{0} and l_{b} may not be supporting lines of S) in polynomial time. First we consider the one-dimensional case and then apply the idea to the two-dimensional case. Especially, the one-dimensional case is important from a standpoint of application to hashing. The problem we consider is as follows: Given a set of n real numbers x_{0}, x_{1}, …, x_{n-1} (we assume that they are sorted and x_{0} = 0 and z_{n-1} = 1 without loss of generality). Consider a hash function of the form (Formula presented.) mod m, where we assume that (Formula presented.) and K and m are given integers. It is easily seen that the hash function is more flexible than the ordinary form h(x) = [K • x] mod m since the latter hash function corresponds to the one in which L and w are fixed to be 0 and l/K, respectively.

本文言語 | English |
---|---|

ホスト出版物のタイトル | Algorithms - International Symposium SlGAL 1990, Proceedings |

編集者 | Toshihide lbaraki, Takao Nishizeki, Hiroshi Imai, Tetsuo Asano |

出版社 | Springer-Verlag |

ページ | 300-309 |

ページ数 | 10 |

ISBN（印刷版） | 9783540529217 |

DOI | |

出版ステータス | Published - 1990 1月 1 |

外部発表 | はい |

イベント | 1st SIGAL International Symposium on Algorithms, 1990 - Tokyo, Japan 継続期間: 1990 8月 16 → 1990 8月 18 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 450 LNCS |

ISSN（印刷版） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### Other

Other | 1st SIGAL International Symposium on Algorithms, 1990 |
---|---|

国/地域 | Japan |

City | Tokyo |

Period | 90/8/16 → 90/8/18 |

## ASJC Scopus subject areas

- 理論的コンピュータサイエンス
- コンピュータ サイエンス（全般）