TOP Page >  Profile

情報研究棟IS Building III 6F
To Lab's Site


Full text / JAIST Repository



Tetsuo Asano President


B.E., M.E.and Ph.D.from Osaka University (1972,1974,1977)

■Professional Career

Lecturer (1977), Associate Professor (1979), Professor (1988) at Osaka Electro-Communication University,Professor at JAIST (1998), Presidential Advisor at JAIST (1999-2000), Senator at JAIST (2002-2004), Assitant to the president (2008-2010), Director of Center for Graduate Education Initiative (2-10-), Dean, School of Information Science (2012-)


Algorithms, especially memory-constrained algorithms, Computational Geometry: theory and applications, Combinatorial Geometry,Combinatorial optimization

■Research Keywords

Algorithm, Computational Geometry, Combinatorial Optimization

■Research Interests

Theoretical Studies:
Computational Geometry is one of the fields in theoretical computer science whose goals are to develop efficient algorithms for solving geometric problems and to analyze their computational complexities. I am especially interested in giving mathematical formulation for practical problems to obtain efficient solutions. For practical applications, problems of handling computation errors and degeneracy are important. Robot motion planning which discusses optimal sequence of robot motion from a given starting configuration to a goal configuration is also an interesting topic.
Memory-constrained algorithms
As memory is getting cheper the demand for solving larger scale problems is getting higher. However, problem sizes grow more rapidly than the memory size and hence we have difficulties to solve problems due to memory size. In our laboratory we are working on designing and proposing new algorithms using small amount of work space. Target problems in computational geometry are for example construction of Voronoi diagrams and Delaunay triangulation, Euclidean minimum spanning tree, shortest path within a simple polygon. Those on image processings are to count the number of connected components in a given binary image, output a binary image defined by a largest connected component, and connected components labeling.そこで作業領域が少なくても動作するアルゴリズムの開発が不可欠であるが,理論的な研究を除いて方法論が確立していないのが現状である.本研究室では,様々な基本的な問題に対して小さな作業領域でも効率よく動作する アルゴリズムの開発を行っている.現在までに開発したアルゴリズムは,計算幾何学の基本的な問題(ボロノイ図作成,デローネイ三角形分割構成,ユークリッド最小木構成,多角形内部の最短経路発見)の他,2値画像に関する基本的な諸問題(連結成分の個数のカウント,最大成分で決まる画像の出力,連結成分に応じたラベリング)などについても小さな作業領域で効率よく問題を解くアルゴリズムの開発に成功している.



  • Site Consistency in Phylogenetic Networks with Recombination, in Algorithmics in Bioniformatics,Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente,College Publications,2006,15-26
  • Handbook on Computational Geometry, Chapter 19: Visibility,J. Sack, edited,Elsevier Science,2000,1027

◇Published Papers

  • Generalizing Hierarchical Structure of Indicesfor Japanese Legal Documents,Tho Thi Ngoc Le∗, Minh Le Nguyen, Akira Shimazu,19th International Conference on Knowledge Based and Intelligent Information and Engineering Systems,2015
  • Depth-First Search Using O(n) Bits,Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Yota Otachi, Hirotaka Ono, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara,The 25th International Symposium on Algorithms and Computation (ISAAC 2014), Lecture Notes in Computer Science, 2014/12/15-2014/12/17, Jeonju, Korea,Vol. 8889,pp. 553-564,2014/12/15
  • Anionic complexes of MWCNT with supergiant cyanobacterial polyanions.,Okajima M., Kumar A., Kaneko T. and et. al.,Biopolymers,99,1,1-9

Display All

◇Lectures and Presentations

  • Algorithmic Approaches to Digital Halftoning,T. Asano,15th Canadian Conference on Computational Geometry,Halifax, Canada,August 2003
  • Similarity between image and terrain: Geometric approaches to computer vision,T. Asano,19th European Workshop on Computational Geometry,Bonn, Germany,March, 2003
  • 「ディジタルハーフトーニング:ネットワークフローアルゴリズムによる最適化」,浅野哲夫,加藤直樹,松井知己,永持仁,小保方幸次,徳山豪,電子情報通信学会コンピュテーション研究会,COMP2001-18, pp.41-48,6月,2001.

Display All

■Extramural Activities

◇Other Activities

  • International Conference on Computational Science and Applications,Preliminary Talk,2005/05/09 - 2005/05/12
  • Guest Editor of Theory of Computing Systems for a special issue on ISAAC'96 (1997)
  • ACM Symposium on Computational Geometry,Program committee member (1997)

Display All

■Academic Awards Received

  • Fellow of IEICE of Japan,IEICE of Japan
  • Fellow, Information Processing Society of Japan,Information Processing Society of Japan