Drawing borders efficiently

Authors:
Kazuo Iwama;Eiji Miyano;Hirotaka Ono
Affiliations:
School of Informatics, Kyoto University, Kyoto, Japan;Department of Systems Innovation and Informatics, Kyushu Institute of Technology, Fukuoka, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan
Venue:
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Year:
2007

Citing 5
Cited 0

Covering polygons is hard

Journal of Algorithms
Polygons

Handbook of discrete and computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Mining for empty spaces in large data sets

Theoretical Computer Science - Database theory
Covering Rectilinear Polygons with Axis-Parallel Rectangles

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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.