Constant Time Generation of Rectangular Drawings with Exactly n Faces
Autor: | Shin-ichi Nakano, Satoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka |
---|---|
Rok vydání: | 2006 |
Předmět: |
Sequence
Plane (geometry) Applied Mathematics Computer Graphics and Computer-Aided Design Planar graph Gray code Combinatorics symbols.namesake Face (geometry) Signal Processing symbols Rectangle Electrical and Electronic Engineering Constant (mathematics) SIMPLE algorithm MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
Zdroj: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :2445-2450 |
ISSN: | 1745-1337 0916-8508 |
Popis: | A plane drawing of a plane graph is called a rectangular drawing if every face including the outer face is a rectangle. A based rectangular drawing is a rectangular drawing with a designated base line segment on the outer face. An algorithm to generate all based rectangular drawings having exactly n faces is known. The algorithm generates each based rectangular drawing having exactly n faces in constant time "on average." In this paper, we give another simple algorithm to generate all based rectangular drawings having exactly n faces. Our algorithm generates each based rectangular drawing having exactly n faces in constant time "in the worst case." Our algorithm generates each based rectangular drawing so that it can be obtained from the preceding one by at most three operations and does not output entire drawings but the difference from the preceding one. Therefore the derived sequence of based rectangular drawings is a kind of combinatorial Gray code for based rectangular drawings. |
Databáze: | OpenAIRE |
Externí odkaz: |