A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. Heuristic search algorithms are used to find desired floorplans in applications, including sheet-cutting, scheduling, and VLSI layout design. Representation of floorplan is critical in floorplan algorithms, because it determines the solution space searched by floorplan algorithms. In this paper, we show a surjective mapping from permutations to room-to-room floorplans. This mapping gives us a simple representation of room-to-room floorplans.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ryo FUJIMAKI, Toshihiko TAKAHASHI, "A Surjective Mapping from Permutations to Room-to-Room Floorplans" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 4, pp. 823-828, April 2007, doi: 10.1093/ietfec/e90-a.4.823.
Abstract: A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. Heuristic search algorithms are used to find desired floorplans in applications, including sheet-cutting, scheduling, and VLSI layout design. Representation of floorplan is critical in floorplan algorithms, because it determines the solution space searched by floorplan algorithms. In this paper, we show a surjective mapping from permutations to room-to-room floorplans. This mapping gives us a simple representation of room-to-room floorplans.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.4.823/_p
Copy
@ARTICLE{e90-a_4_823,
author={Ryo FUJIMAKI, Toshihiko TAKAHASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Surjective Mapping from Permutations to Room-to-Room Floorplans},
year={2007},
volume={E90-A},
number={4},
pages={823-828},
abstract={A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. Heuristic search algorithms are used to find desired floorplans in applications, including sheet-cutting, scheduling, and VLSI layout design. Representation of floorplan is critical in floorplan algorithms, because it determines the solution space searched by floorplan algorithms. In this paper, we show a surjective mapping from permutations to room-to-room floorplans. This mapping gives us a simple representation of room-to-room floorplans.},
keywords={},
doi={10.1093/ietfec/e90-a.4.823},
ISSN={1745-1337},
month={April},}
Copy
TY - JOUR
TI - A Surjective Mapping from Permutations to Room-to-Room Floorplans
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 823
EP - 828
AU - Ryo FUJIMAKI
AU - Toshihiko TAKAHASHI
PY - 2007
DO - 10.1093/ietfec/e90-a.4.823
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2007
AB - A floorplan is a subdivision of a rectangle into rectangular faces with horizontal and vertical line segments. Heuristic search algorithms are used to find desired floorplans in applications, including sheet-cutting, scheduling, and VLSI layout design. Representation of floorplan is critical in floorplan algorithms, because it determines the solution space searched by floorplan algorithms. In this paper, we show a surjective mapping from permutations to room-to-room floorplans. This mapping gives us a simple representation of room-to-room floorplans.
ER -