TY - JOUR
T1 - Drawing borders efficiently
AU - Iwama, Kazuo
AU - Miyano, Eiji
AU - Ono, Hirotaka
N1 - Funding Information:
This work is in part supported by KEKENHI, No. 16092101, 16092215, 16092223, 16300002, 17700022, 18300004 and 18700014.
PY - 2009/2
Y1 - 2009/2
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 \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.
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 \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.
UR - http://www.scopus.com/inward/record.url?scp=59549087080&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=59549087080&partnerID=8YFLogxK
U2 - 10.1007/s00224-008-9117-y
DO - 10.1007/s00224-008-9117-y
M3 - Article
AN - SCOPUS:59549087080
SN - 1432-4350
VL - 44
SP - 230
EP - 244
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 2
ER -