Theoretical Foundation of Innovative Data Analysis Based on Computational Geometry and Topology
Project/Area Number |
15K00009
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | The University of Electro-Communications |
Principal Investigator |
Okamoto Yoshio 電気通信大学, 大学院情報理工学研究科, 教授 (00402660)
|
Project Period (FY) |
2015-04-01 – 2019-03-31
|
Project Status |
Completed (Fiscal Year 2018)
|
Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2016: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
Keywords | 計算幾何学 / 離散数学 / アルゴリズム理論 / 離散幾何学 |
Outline of Final Research Achievements |
Below is the summary of representative results from this project. (1) Efficient algorithms have been developed for computing the diameter and the radius of a bounded polygonal domain. (2) Prescription of edge lengths has been studied for graphs embedded on the plane by straight line segments without edge crossings. (3) Restrictions of edge crossing patterns and curve types have been studied for graphs embedded on the plane. (4) Recursive decomposition data structures have been proposed for unit disk graphs that have been used for modeling sensor networks in the literature.
|
Academic Significance and Societal Importance of the Research Achievements |
計算幾何学,計算トポロジーは情報学基礎理論における比較的若い研究分野であるが,それであっても,多くの問題が未解決のまま残されている.現在,幾何的データやトポロジー的データは世の中に満ち溢れ,それらの処理に対して,計算幾何学と計算トポロジーの果たす役割は今後一層増していくことが予想される.そのような未来に対して,本研究の培った技法や知見が基盤的な位置づけを担うこととなる.
|
Report
(5 results)
Research Products
(57 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Exact Algorithms for the Max-Min Dispersion Problem2018
Author(s)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
-
Journal Title
Proceedings of 12th International Frontiers of Algorithmics Workshop (FAW 2018)
Volume: ---
Pages: 263-272
DOI
NAID
ISBN
9783319784540, 9783319784557
Related Report
Peer Reviewed
-
-
-
-
-
-
-
[Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
-
Journal Title
Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
Volume: ---
Pages: 287-296
DOI
NAID
ISBN
9783319623887, 9783319623894
Related Report
Peer Reviewed / Open Access
-
-
[Journal Article] Balanced line separators of unit disk graphs2017
Author(s)
Paz Carmi, Man Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, Andre van Renssen, Marcel Roeloffzen, Taichi Shiitada, and Shakhar Smorodinsky
-
Journal Title
Proceedings of 15th Algorithms and Data Structures Symposium (WADS 2017)
Volume: ---
Pages: 241-252
DOI
ISBN
9783319621265, 9783319621272
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
[Journal Article] Sequentially Swapping Colored Tokens on Graphs2017
Author(s)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno
-
Journal Title
Proceedings of 11th International Conference and Workshop on Algorithms and Computation (WALCOM 2017)
Volume: -
Pages: 435-447
DOI
NAID
ISBN
9783319539249, 9783319539256
Related Report
Peer Reviewed / Int'l Joint Research
-
[Journal Article] Approximation and Hardness of Token Swapping2017
Author(s)
Tillmann Miltzow, Lothar Narins, Yoshio Okamoto, Gunter Rote, Antonis Thomas, Takeaki Uno
-
Journal Title
Proceedings of 24th European Symposium on Algorithms (ESA 2016)
Volume: -
Pages: 1-15
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
[Journal Article] On problems as hard as CNF-SAT2016
Author(s)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlstrom
-
Journal Title
ACM Transactions on Algorithms
Volume: 12
Issue: 3
Pages: 1-24
DOI
Related Report
Peer Reviewed / Int'l Joint Research
-
[Journal Article] Efficient Stabilization of Cooperative Matching Games2016
Author(s)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
-
Journal Title
Proceedings of 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
Volume: なし
Pages: 41-49
Related Report
Peer Reviewed / Open Access / Acknowledgement Compliant
-
-
-
-
-
[Journal Article] On problems as hard as CNF-SAT2016
Author(s)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
-
Journal Title
ACM Transactions on Algorithms
Volume: ---
Related Report
Peer Reviewed / Int'l Joint Research
-
-
[Journal Article] Free edge lengths in plane graphs2015
Author(s)
Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Morić, Yoshio Okamoto, Tibor Szabó, and Csaba Tóth
-
Journal Title
Discrete & Computational Geometry
Volume: 54
Issue: 1
Pages: 259-289
DOI
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
-
-
-
-
[Presentation] Balanced line separators of unit disk graphs2017
Author(s)
Paz Carmi, Man Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, Andre van Renssen, Marcel Roeloffzen, Taichi Shiitada, and Shakhar Smorodinsky
Organizer
15th Algorithms and Data Structures Symposium (WADS 2017)
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-