Drawing borders efficiently
From MaRDI portal
Publication:2272197
DOI10.1007/s00224-008-9117-yzbMath1179.68197OpenAlexW2127354717MaRDI QIDQ2272197
Kazuo Iwama, Hirotaka Ono, Eiji Miyano
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Complexities of efficient solutions of rectilinear polygon cover problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Mining for empty spaces in large data sets.
- Close approximations of minimum rectangular coverings
- Covering Polygons Is Hard
- Covering Rectilinear Polygons with Axis-Parallel Rectangles
This page was built for publication: Drawing borders efficiently