Advertisement

Drawing Borders Efficiently

  • Kazuo Iwama
  • Eiji Miyano
  • Hirotaka Ono
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

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 \({\cal 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

Line Segment Vertical Line Segment Horizontal Line Segment Horizontal Black Line Black Border 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berman, P., DasGupta, B.: Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4), 331–356 (1997)MathSciNetCrossRefzbMATHGoogle 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. of Computer and System Science 13, 335–379 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. of Algorithms 17, 2–44 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty rectangles in large data sets. Theoretical Computer Science 296, 435–452 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H.Freeman & Co, New York (1979)zbMATHGoogle Scholar
  6. 6.
    Greenberg, D.S., Istrail, S.C.: Physical mapping by STS hybridization: Algorithmic strategies and the challenge of software evaluation. J. Computational Biology 2, 219–274 (1995)CrossRefGoogle Scholar
  7. 7.
    Gudmundsson, J., Levcopoulos, C.: Close approximations of minimum rectangular coverings. J. of Combinatorial Optimization 3(4), 437–452 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Hegedüs, A.: Algorithms for covering polygons by rectangles. Computer Aided Geometric Design 14, 257–260 (1982)CrossRefGoogle Scholar
  9. 9.
    Anil Kumar, V.S., Ramesh, H.: Covering Rectilinear Polygons with Axis-Parallel Rectangles. SIAM Journal on Computing 32(6), 1509–1541 (2003)MathSciNetCrossRefzbMATHGoogle 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 NP-complete set covering problems. MIT, Cambridge, MA, unpublished manuscript. Referenced in [5] (1978)Google Scholar
  12. 12.
    Reuhman, D.: A short route to tgif pictures. ftp://bourbon.usc.edu/pub/tgif/contrib/tgifintro/ (2002)Google Scholar
  13. 13.
    Suri, S.: Polygons. In: Suri, S., 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.4), http://www.xfig.org/usrman/frm_main_menus.html

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Kazuo Iwama
    • 1
  • Eiji Miyano
    • 2
  • Hirotaka Ono
    • 3
  1. 1.School of Informatics, Kyoto University, Kyoto 606-8501Japan
  2. 2.Department of Systems Innovation and Informatics, Kyushu Institute of Technology, Fukuoka 820-8502Japan
  3. 3.Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka 819-0395Japan

Personalised recommendations