Theory of Computing Systems

, 44:230 | Cite as

Drawing Borders Efficiently

Article
First Online:
Received:
Accepted:

Abstract

A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawing tables. Using spreadsheets, we often wish to draw several vertical and horizontal black lines on selective gridlines to enhance the readability of our spreadsheet. Such situations we frequently encounter are formulated as the Border Drawing Problem (BDP). Given a layout of black line segments, we study how to draw it efficiently from an algorithmic view point, by using a set of border styles and investigate its complexity. (i) We first define a formal model based on MS Excel, under which the drawability and the efficiency of border styles are discussed, and then (ii) show that unfortunately the problem is \(\mathcal{NP}\) -hard for the set of the Excel border styles and for any reasonable subset of the styles. Moreover, in order to provide potentially more efficient drawing, (iii) we propose a new compact set of border styles and show a necessary and sufficient condition of its drawability.

Keywords

Algorithm Combinatorial optimization Spreadsheet NP-hardness Approximation algorithm 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Berman, P., DasGupta, B.: Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4), 331–356 (1997) MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976) MATHMathSciNetGoogle Scholar
  3. 3.
    Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17, 2–44 (1994) MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty rectangles in large data sets. Theor. Comput. Sci. 296, 435–452 (2003) MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability—A Guide to the Theory of \(\mathcal{NP}\) -Completeness. Freeman, New York (1979) Google Scholar
  6. 6.
    Greenberg, D.S., Istrail, S.C.: Physical mapping by STS hybridization: algorithmic strategies and the challenge of software evaluation. J. Comput. Biol. 2, 219–274 (1995) CrossRefGoogle Scholar
  7. 7.
    Gudmundsson, J., Levcopoulos, C.: Close approximations of minimum rectangular coverings. J. Comb. Optim. 3(4), 437–452 (1999) MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hegedüs, A.: Algorithms for covering polygons by rectangles. Comput. Aided Geom. Des. 14, 257–260 (1982) Google Scholar
  9. 9.
    Anil Kumar, V.S., Ramesh, H.: Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput. 32(6), 1509–1541 (2003) MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Magwene, P.M., Lizardi, P., Kim, J.: Reconstructing the temporal ordering of biological samples using microarray data. Bioinformatics 19(7), 842–850 (2003) CrossRefGoogle Scholar
  11. 11.
    Masek, W.J.: Some \(\mathcal{NP}\) -complete set covering problems. MIT, Cambridge. Unpublished manuscript (1978). Referenced in [5] Google Scholar
  12. 12.
    Reuhman, D.: A short route to tgif pictures. ftp://bourbon.usc.edu/pub/tgif/contrib/tgifintro/ (2002)
  13. 13.
    Suri, S.: Polygons. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997) Google Scholar
  14. 14.
    Xfig User Manual (ver. 3.2.5). http://www.xfig.org/userman/

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.School of InformaticsKyoto UniversityKyotoJapan
  2. 2.Department of Systems Design and InformaticsKyushu Institute of TechnologyFukuokaJapan
  3. 3.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations