Storing and restoring floorplan partition data via removing sequences
A floorplan is a rectangle partitioned into smaller rectangles using vertical and horizontal line segments such that no four rectangles meet at the same point. One problem in coding theory is on storing and restoring oorplan partition data using binary codewords. There are several ways to do this, o...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2018
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18574 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | A floorplan is a rectangle partitioned into smaller rectangles using vertical and horizontal line segments such that no four rectangles meet at the same point. One problem in coding theory is on storing and restoring oorplan partition data using binary codewords. There are several ways to do this, one way is via removing sequences of a oorplan. The removing sequence of a oorplan is essentially removing the upper-most left face of a oorplan sequentially until one face remains. In this paper we use the removing sequence of a oorplan to store and restore the data via binary codewords. |
|---|