Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair

@inproceedings{Kodama2003SelectedSA,
  title={Selected sequence-pair: an efficient decodable packing representation in linear time using sequence-pair},
  author={Chikaaki Kodama and Kunihiro Fujiyoshi},
  booktitle={ASP-DAC},
  year={2003}
}
In this paper, we propose "selected sequence-pair" (SSP), a sequence-pair (seq-pair) with the limited number of subsequences called adjacent crosses. Its features are: (1) The smallest packing based on a given SSP can be obtained in O(n) time, where n is the number of rectangles. (2) An arbitrary packing can be represented by SSP. (3) The total representation number of SSP of size n is not more than that of rectangular dissection of the same size with n-[√4n-1] empty rooms (the necessary number… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Counting of the topological dissections by reduct-seq representation

  • K. Sakanushi, Y. Kajitani
  • Technical Report IEICE, COMP2000-17, pp.25–32…
  • 2000
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…