| Project/Area Number |
10205223
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research on Priority Areas (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Institution | Chuo University |
|---|
Principal Investigator |
IMAI Keiko Chuo University, Faculty of Science and Engineering, Professor, 理工学部, 教授 (70203289)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
IKEBE Yoshiko Tokyo University of Science, faculty of Engineering, Assistant Professor, 工学部, 講師 (60291704)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Project Status |
Completed (Fiscal Year 2001)
|
| Budget Amount *help |
¥10,200,000 (Direct Cost: ¥10,200,000)
Fiscal Year 2000: ¥2,400,000 (Direct Cost: ¥2,400,000)
Fiscal Year 1999: ¥3,400,000 (Direct Cost: ¥3,400,000)
Fiscal Year 1998: ¥4,400,000 (Direct Cost: ¥4,400,000)
|
|---|
| Keywords | Computational Geometry / Geometric Structure / Geographic Information System / Label Placement Problems / Point Location / Computational Topology / Topological Invariant / 動的・実時間環境 / 計算幾何学 / NP困難問題 / 地理情報システム / Jones多項式 / 三角形分割 / Voronoi図 / 凸多面体 / 列挙問題 / 地理情報処理システム |
|---|
| Research Abstract |
The aim of this research is to develop efficient algorithms for discrete problems with geometric information under dynamic and on-line environments. Many practical problems have dynamic and on-line natures, and those discrete structures include geometric information. Many efficient results have been investigated for static discrete problems. However, algorithms should be newly designed to handle dynamic and on-line factors and geometric structures.
First, we investigate fundamental concepts in computational geometry such as Voronoi diagrams and triangulations in dynamic environments. We develop algorithms for dynamic Voronoi diagrams and apply them to geometric fitting problems and polygon containment problems. Triangulation is also one of the important concepts in computational geometry, and we research on structures of triangulations of points.
In geographic information systems (GIS), there are many geometric problems with dynamic and on-line environments, and we mainly focus on map labeling problems. Map labeling problems are important in GIS, and NP-hard in general. We consider the problem for labeling points and curves on maps drawn from digital data. Our algorithm labels points and curves simultaneously in a beautiful way. Computational results for subway and JR railroad maps in Tokyo are also reported. Moreover, we consider a new model in the node label placement problems. In the model, each label connects with the corresponding point by means of a leader line, and we propose some algorithms for the problem.
In dynamic and on-line environments, we have to handle topological changes of geometric structure. In terms of this standpoint, we investigate the Jones polynomial, which is an invariant in knot theory. It is shown that the new algorithm of computing the Tutte polynomial can be applied to computing the Jones polynomial of an arbitrary link. Although computing the Jones polynomial is #P-hard, it can be calculated for some large links.
|
