TY - GEN
T1 - Drawing borders efficiently
AU - Iwama, Kazuo
AU - Miyano, Eiji
AU - Ono, Hirotaka
PY - 2007
Y1 - 2007
N2 - 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 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.
AB - 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 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.
UR - http://www.scopus.com/inward/record.url?scp=38049061587&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049061587&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72914-3_19
DO - 10.1007/978-3-540-72914-3_19
M3 - Conference contribution
AN - SCOPUS:38049061587
SN - 9783540729136
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 213
EP - 226
BT - Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Fun with Algorithms, FUN 2007
Y2 - 3 June 2007 through 5 June 2007
ER -