Minimally covering a horizontally convex orthogonal polygon

Authors:
J M Keil
Affiliations:
Department of Computational Science, University of Saskatchewan, Saskatoon, Canada, S7N 0W0
Venue:
SCG '86 Proceedings of the second annual symposium on Computational geometry
Year:
1986

Citing 6
Cited 11

The Power of Non-Rectilinear Holes

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Decomposing a polygon into its convex parts

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
An algorithm for constructing regions with rectangles: Independence and minimum generating sets for collections of intervals

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational geometry and convexity

Computational geometry and convexity
Rectilinear computational geometry

Rectilinear computational geometry
The art gallery theorem: its variations, applications and algorithmic aspects

The art gallery theorem: its variations, applications and algorithmic aspects

Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons

SCG '87 Proceedings of the third annual symposium on Computational geometry
Variations on visibility

SCG '87 Proceedings of the third annual symposium on Computational geometry
A Bibliography on Digital and Computational Convexity (1961-1988)

IEEE Transactions on Pattern Analysis and Machine Intelligence
Covering orthogonal polygons with star polygons: the perfect graph approach

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Minimum K-partitioning of rectilinear polygons

Journal of Symbolic Computation
Covering rectilinear polygons with axis-parallel rectangles

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Partitioning rectilinear figures into rectangles

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Note on covering monotone orthogonal polygons with star-shaped polygons

Information Processing Letters
Linear-time 3-approximation algorithm for the r-star covering problem

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
ACCORD: with approximate covering of convex orthogonal decomposition

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present &Ogr;(n2) time algorithms for the problems of covering a horizontally convex orthogonal polygon with the minimum number of orthogonal convex polygons and with the minimum number of orthogonal star-shaped polygons.