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: Chung, Wisely O., Geronimo, John Alby L.
格式: text
語言:English
出版: Animo Repository 2018
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_bachelors/18574
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
id oai:animorepository.dlsu.edu.ph:etd_bachelors-19087
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-190872022-02-11T06:59:20Z Storing and restoring floorplan partition data via removing sequences Chung, Wisely O. Geronimo, John Alby L. 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. 2018-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18574 Bachelor's Theses English Animo Repository Mathematics
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Mathematics
spellingShingle Mathematics
Chung, Wisely O.
Geronimo, John Alby L.
Storing and restoring floorplan partition data via removing sequences
description 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.
format text
author Chung, Wisely O.
Geronimo, John Alby L.
author_facet Chung, Wisely O.
Geronimo, John Alby L.
author_sort Chung, Wisely O.
title Storing and restoring floorplan partition data via removing sequences
title_short Storing and restoring floorplan partition data via removing sequences
title_full Storing and restoring floorplan partition data via removing sequences
title_fullStr Storing and restoring floorplan partition data via removing sequences
title_full_unstemmed Storing and restoring floorplan partition data via removing sequences
title_sort storing and restoring floorplan partition data via removing sequences
publisher Animo Repository
publishDate 2018
url https://animorepository.dlsu.edu.ph/etd_bachelors/18574
_version_ 1772835214376042496