Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 50th Annual Conference of the Institute of Systems, Control and Information Engineers
Session ID : 7F1-2
Conference information

Host: The Institute of Systems, Control and Information Engineers

A computation algorithm for the inverse problem of planar cell-complexes
*Yukako OHHATA, Ryuji ENOMOTO
Author information
Keywords: planar cell complex, inverse problem, Morse equation, computational algorithm
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Download PDF (81K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
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.
Content from these authors
© 2006 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top