Drawing borders efficiently

Kazuo Iwama, Eiji Miyano, Hirotaka Ono

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)230-244
Number of pages15
JournalTheory of Computing Systems
Volume44
Issue number2
DOIs
Publication statusPublished - Feb 1 2009

Fingerprint

Drawing (graphics)
Spreadsheets
Excel
Spreadsheet
Application programs
Personal computers
Personal Computer
Formal Model
Line segment
Compact Set
Tables
Layout
Horizontal
NP-complete problem
Vertical
Style
Drawing
Model-based
Necessary Conditions
Subset

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Drawing borders efficiently. / Iwama, Kazuo; Miyano, Eiji; Ono, Hirotaka.

In: Theory of Computing Systems, Vol. 44, No. 2, 01.02.2009, p. 230-244.

Research output: Contribution to journalArticle

Iwama, K, Miyano, E & Ono, H 2009, 'Drawing borders efficiently', Theory of Computing Systems, vol. 44, no. 2, pp. 230-244. https://doi.org/10.1007/s00224-008-9117-y
Iwama, Kazuo ; Miyano, Eiji ; Ono, Hirotaka. / Drawing borders efficiently. In: Theory of Computing Systems. 2009 ; Vol. 44, No. 2. pp. 230-244.
@article{5d3c563334004fc286dac18b1b21f428,
title = "Drawing borders efficiently",
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.",
author = "Kazuo Iwama and Eiji Miyano and Hirotaka Ono",
year = "2009",
month = "2",
day = "1",
doi = "10.1007/s00224-008-9117-y",
language = "English",
volume = "44",
pages = "230--244",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

T1 - Drawing borders efficiently

AU - Iwama, Kazuo

AU - Miyano, Eiji

AU - Ono, Hirotaka

PY - 2009/2/1

Y1 - 2009/2/1

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

VL - 44

SP - 230

EP - 244

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 2

ER -