Drawing borders efficiently

DOI10.1007/S00224-008-9117-YMaRDI QIDQ2272197zbMATH OpenOpenAlexFDO

Authors Kazuo Iwama, Eiji Miyano, Hirotaka Ono

Publication date 6 August 2009

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2324/14764

zbMATH Keywords

approximation algorithmcombinatorial optimizationNP-hardnessspreadsheet

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Drawing Borders Efficiently
• scientific article; zbMATH DE number 1117902
• Graph graphics: Theory and practice
• Spirality and Optimal Orthogonal Drawings
• Some provably hard crossing number problems

Cites work

• Close approximations of minimum rectangular coverings
• Complexities of efficient solutions of rectilinear polygon cover problems
• Covering Polygons Is Hard
• Covering Rectilinear Polygons with Axis-Parallel Rectangles
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mining for empty spaces in large data sets.
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(2)

• Drawing Borders Efficiently
• The complexity of flood filling games

Describes a project that uses

Uses Software

• Excel
• Xfig

This page was built for publication: Drawing borders efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272197)