Efficient Enumeration of All Pseudoline Arrangements
スポンサーリンク
概要
- 論文の詳細を見る
Pseudoline arrangements are important and appealing objects in the area of geometory and combinatrics. In this paper we give an algorithm to enumerate all arrangements of n pseudolines. After O (n2) time preprocessing, our algorithm enumerates all arrangements in O (1) time for each and uses O (n2) space.
- 一般社団法人情報処理学会の論文
- 2009-05-04
著者
-
Katsuhisa Yamanaka
Graduate School of Information Systems, University of Electro-communications.
-
Yasuko Matsui
Department Of Mathematical Sciences Tokai University
-
Ryuhei Uehara
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Uehara Ryuhei
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Matsui Yasuko
Department Of Mathematical Sciences Tokai University
-
Kento Nakada
Research Institute For Mathematical Sciences Kyoto University
-
Katsuhisa Yamanaka
Graduate School Of Information Systems University Of Electro-communications.
-
Ryuhei Uehara
School Of Information Science Jaist
関連論文
- Enumerating All Rooted Trees Including k Leaves
- Design and Synthesis of Dipeptide-type HIV-1 Protease Inhibitors with High Antiviral Activity
- Efficient Enumeration of All Pseudoline Arrangements
- An Approach for Peptidic Aspartic Protease Inhibitors Using Ala-containing Oligopeptides Independent of the Substrate Sequence
- Graph Orientation Problems for Multiple st-Reachability
- Computational Complexities of University Interview Timetabling
- Random Generation and Enumeration of Proper Interval Graphs
- Efficient Enumeration of All Ladder Lotteries with k Bars
- Efficient Enumeration of All Pseudoline Arrangements
- The Complexity of Free Flood Filling Games
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
- A Compact Encoding of Rectangular Drawings with Edge Lengths
- Approximating the path-distance-width for k-cocomparability graphs
- On the number of reduced trees, cographs, and series-parallel graphs by compression
- Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
- NP-completeness of generalized Kaboozle
- Coding Ladder Lotteries
- Computational Complexity of Piano-Hinged Dissections
- Bumpy Pyramid Folding Problem
- Zipper Unfolding of Domes and Prismoids
- Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs
- Intersection dimension of bipartite graphs
- FPT algorithms for Token Jumping on Graphs
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid