Floorplans with Walls
| Autor: | Katsuhisa Yamanaka, Shin-ichi Nakano |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
050101 languages & linguistics
Horizontal line segment 05 social sciences Boundary line 02 engineering and technology Floorplan Combinatorics Line segment 0202 electrical engineering electronic engineering information engineering Enumeration Partition (number theory) 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Vertical segment Rectangle Mathematics |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030592660 TAMC |
| DOI: | 10.1007/978-3-030-59267-7_5 |
| Popis: | Let P be a set of n points in the proper inside of an axis-aligned rectangle R, and each point in P is either h-type, v-type or f-type. We wish to partition R into a set S of \(n+1\) rectangles by n line segments so that each point in P is on the common boundary line segment between two rectangles in S, and also each h-type point in P is on a horizontal line segment and each v-type point in P is on a vertical line segment. (Each f-type point in P is on a line segment. f-type menas free type). Such a partition of R is called a feasible floorplan of R with respect to P. Each point in P corresponds to the location of a structurally necessary horizontal or vertical wall, or a column (pillar) to support upper part, and a feasible floorplan is a floorplan achieving suitable earthquake resistance. An algorithm to enumerate all feasible floorplans of R with respect to P is known when P consists of only f-type points. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|