Enumerating floorplans with walls

DOI10.1016/j.dam.2023.08.018MaRDI QIDQ6143840

Shin-ichi Nakano, Katsuhisa Yamanaka

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumeration algorithmfloorplanfeasible floorplan

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Generating rooted triangulations without repetitions
• Reverse search for enumeration
• Analysis and enumeration. Algorithms for biological graphs
• On the number of rectangulations of a planar point set
• Rectangular dualization and rectangular dissections
• On Floor-Plan of Plane Graphs
• Enumerating Floorplans with Some Properties
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating floorplans with walls