A computation algorithm for the inverse problem of planar cell-complexes

• OHHATA Yukako

  Advanced course, Toba National College of Maritime Technology

• ENOMOTO Ryuji

  Advanced course, Toba National College of Maritime Technology

Bibliographic Information

Other Title

• 平面的セル複体の逆問題の解法アルゴリズム

Abstract

A planar cell-complex is a 2-dimensional cell-complex which can be drawn on a planar surface. The inverse problem of planar cell-complexes is a problem of enumerating all planar cell-complexes when the number of the 0-cells, 1-cells and 2-cells of the cell-complex is given for us. In this paper we show an algorithm to solve this problem.

Journal

• Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers

  Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers SCI06 (0), 269-269, 2006

  The Institute of Systems, Control and Information Engineers

Keywords

• planar cell complex
• inverse problem
• Morse equation
• computational algorithm

Details

• CRID: 1390001205622016768
• NII Article ID: 130004667886
• DOI: 10.11509/sci.sci06.0.269.0
• Data Source:
  • JaLC
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed