• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2000 Fiscal Year Final Research Report Summary

Realization of Geographic Information Systems with High-Quality Processing Based on Computational Geometry

Research Project

Project/Area Number 09558029
Research Category

Grant-in-Aid for Scientific Research (B).

Allocation TypeSingle-year Grants
Section展開研究
Research Field 計算機科学
Research Institutionthe University of Tokyo

Principal Investigator

IMAI Hiroshi  Graduate School of Science, the University of Tokyo Assoc.Prof., 大学院・理学系研究科, 助教授 (80183010)

Co-Investigator(Kenkyū-buntansha) IMAI Keiko  Chuo University, Fac.Sci.Tech., Prof., 理工学部, 教授 (70203289)
INABA Mary  Graduate School of Science, the University of Tokyo Lecturer, 大学院・理学系研究科, 講師 (60282711)
ASAI Ken-ichi  Graduate School of Science, the University of Tokyo Research Assistant, 大学院・理学系研究科, 助手 (10262156)
TOKUYAMA Takeshi  Tohoku University, GSIS, Prof., 大学院・情報科学研究科, 教授 (40312631)
KUBOTA Koichi  Chuo University, Fac.Sci.Tech., Assoc.Prof., 理工学部, 助教授 (90178046)
Project Period (FY) 1997 – 2000
Keywordsgeographical information system / computational geometry / robust computation / geographical database / Voronoi diagram / vehicle routing
Research Abstract

In this research, geographical information systems (GIS for short) as well as intelligent transport systems (ITS for short) have been investigated from the viewpoint of computational geometry to meet emerging demands to realize high-quality, robust and fast systems in both fields. From the viewpoint of computational geometry, we also developed efficient geometric clustering algorithms, both in Euclidean and information geometric spaces, and applied them to geographical data mining. Also, map labeling problem and map matching problems are studied.
Specifically, by using robust algorithm to construct the Voronio diagram and Delaunay triangulation of points in the plane, we developed an efficient and simple method of computing the medical axis, as central lines of roads, for town maps. With such nice tools, this kind of seemingly complicated problem can be solved in practice in a very precise manner. Concerning the map labeling problem, subway maps are intensively studied where labels corresponding to each subway line are automatically placed in a beautiful way. Concerning ITS, we have proposed an intelligent algorithm to find meaningful detours for high-level car navigation. Also, a new method of measuring traffic flows from simple sensor data derived at two distant points is presented. The Voronoi diagram has bee used directly in GIS, and we generalize it to the diagram in statistical parameter space. When GIS is combined with other data such as population data, the space becomes higher-dimensional geometric space, to which our generalized diagrams can be used to find proximity relations, etc., by using computational-geometric algorithms.

  • Research Products

    (16 results)

All Other

All Publications (16 results)

  • [Publications] N.Park,H.Okano and H.Imai: "A Path-Exchange-Type Local Search Algorithm for Vehicle Routing and Its Efficient Search Strategy"Journal of the Operations Research Society of Japan. 43,1. 197-208 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.Imai,K.Imai,K.Inaba and K.Kubota: "GIS and ITS Infrastructures in Japan-Standardization and Network-Algorithmic Applications"Proceedings of the International Workshop on Emerging Technologies for Geo-Based Applications. 153-167 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.Imai and M.Inaba: "Geometric Clustering by Divergence and Its Underlying Discrete Proximity Structures"IEICE Trans.Information and Systems. E83-D,1. 27-35 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M.Inaba,N.Katoh and H.Imai: "Variance-Based κ-Clustering Algorithms by Voronoi Diagrams and Randomization"IEICE Trans.Information and Systems. E83-D,6. 1199-1206 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Y.Asano and H.Imai: "Practical Efficiency of the Linear-Time Algorithm for the Single Source Shortest Path Problem"Journal of the Operations Society of Japan. 431-447 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Osogami and H.Imai: "Classification of Various Neighborhood Operations for the Nurse Scheduling Problem"Lecture Notes in Computer Science. 1969. 72-83 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Asano,H.Imai,D.T.Lee,S.Nakano,T.Tokuyama,eds.: "Computing and Combinatorics"Spriger-Verlag. 494 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 今井浩 編集: "特集:計算幾何の拡がり-情報科学・応用数理・数学にまたがる発展"サイエンス社. No.433 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] N.Park, H.Okano and H.Imai: "A Path-Exchange-Type Local Search Algorithm for Vehicle Routing and Its Efficient Search Strategy"Journal of the Operations Research Society of Japan. 43, 1. 197-208 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Imai, K.Imai, K.Inaba and K.Kubota: "GIS and ITS Infrastructures in Japan - Standardization and Network-Algorithmic Applications"Proceedings of the International Workshop on Emerging Technologies for Geo-Based Applications. 153-167 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Imai and M.Inaba: "Geometric Clustering by Divergence and Its Underlying Discrete Proximity Structures"IEICE Trans.Information and Systems. E83-D, 1. 27-35 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] M.Inaba, N.Katoh and H.Imai: "Variance-Based ^k-Clustering Algorithms by Voronoi Diagrams and Randomization"IEICE Trans.Information and Systems. E83-D, 6. 1199-1206 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Y.Asano and H.Imai: "Practical Efficiency of the Linear-Time Algorithm for the Single Source Shortest Path Problem"Journal of the Operations Society of Japan. 431-447 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Osogami and H.Imai: "Classification of Various Neighborhood Operations for the Nurse Scheduling Problem"Lecture Notes in Computer Science. 1969. 72-83 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Asano, H.Imai, D.T.Lee, S.Nakano, T.Tokuyama, eds.: "Computing and Combinatorics"Spriger-Verlag. 494 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] H.Imai, ed.: "Expansion of Computational Geometry -Information Science, Applied Mathematics and Mathematics"Science-sha. No.433 (1999)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2002-03-26  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi