WEKO3
アイテム
A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line
http://hdl.handle.net/2261/00074077
http://hdl.handle.net/2261/00074077645c5b26-8488-4dcd-99b1-3a12eb72e4c9
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line 1991.pdf (294.8 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-12-14 | |||||
| タイトル | ||||||
| タイトル | A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
IMAI, Hiroshi
× IMAI, Hiroshi |
|||||
| 著者所属 | ||||||
| 著者所属 | Department of Computer Science, University of Tokyo | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | This paper gives an O(n log n)-time algorithm for the following problem: min Σni=1|xi-ai| s.t.x1≦x2≦...≦xn where ai(i=1, ..., n) are given constants and xi(i=1, ..., n) are variables. There has been given an O(n2)-time incremental algorithm, and we improve it by using the heap as a data structure and modify the incremental algorithm partly. This problem is a kind of the geometric fitting problem between two corresponding sets of points on a line which is related to some VLSI layout design problem. | |||||
| 内容記述 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications) | |||||
| 書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E74-A, 号 4, p. 665-668, 発行日 1991-04-25 |
|||||
| 権利 | ||||||
| 権利情報 | copyright©1991 IEICE | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 出版者 | ||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||
| 関係URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://search.ieice.org/ | |||||
