Drawing borders efficiently

Kazuo Iwama, Eiji Miyano, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 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
Title of host publicationFun with Algorithms - 4th International Conference, FUN 2007, Proceedings
Pages213-226
Number of pages14
Volume4475 LNCS
Publication statusPublished - 2007
Event4th International Conference on Fun with Algorithms, FUN 2007 - Castiglioncello, Italy
Duration: Jun 3 2007Jun 5 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4475 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Fun with Algorithms, FUN 2007
CountryItaly
CityCastiglioncello
Period6/3/076/5/07

Fingerprint

Drawing (graphics)
Spreadsheets
Microcomputers
Software
Excel
Spreadsheet
Application programs
Personal computers
Computational complexity
Personal Computer
Formal Model
Line segment
Compact Set
Tables
Layout
Horizontal
NP-complete problem
Vertical
Style
Drawing

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Iwama, K., Miyano, E., & Ono, H. (2007). Drawing borders efficiently. In Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings (Vol. 4475 LNCS, pp. 213-226). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4475 LNCS).

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

Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings. Vol. 4475 LNCS 2007. p. 213-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4475 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Iwama, K, Miyano, E & Ono, H 2007, Drawing borders efficiently. in Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings. vol. 4475 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4475 LNCS, pp. 213-226, 4th International Conference on Fun with Algorithms, FUN 2007, Castiglioncello, Italy, 6/3/07.
Iwama K, Miyano E, Ono H. Drawing borders efficiently. In Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings. Vol. 4475 LNCS. 2007. p. 213-226. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Iwama, Kazuo ; Miyano, Eiji ; Ono, Hirotaka. / Drawing borders efficiently. Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings. Vol. 4475 LNCS 2007. pp. 213-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{de5097461e2c407288acafcd59841015,
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 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 = "2007",
language = "English",
isbn = "9783540729136",
volume = "4475 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "213--226",
booktitle = "Fun with Algorithms - 4th International Conference, FUN 2007, Proceedings",

}

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

M3 - Conference contribution

SN - 9783540729136

VL - 4475 LNCS

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

ER -