Covering Rectilinear Polygons with Axis-Parallel Rectangles
نویسندگان
چکیده
منابع مشابه
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
Finding the minimum number of rectangles required to cover a rectilinear or orthogonal polygon, where overlapping of rectangles is allowed, is one of several well-known, hard geometric decomposition problems. This paper reports the first results known that give worst-case performance bounds for an approximation algorithm for this problem. It is proved that partitioning the polygon into rectangl...
متن کاملColoring Axis-Parallel Rectangles
For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r = 2, this answers a question of S. Smorodinsky [S07].
متن کاملAlgorithm for windowing the axis-parallel rectangles
A problem arising in the 3-dim visualization of geographic maps is to select those map cells that intersect the observer’s frustum. In a trivial approach one just checks all the cells form a database for the intersection with the given frustum, which causes noticeable hang-ups of the visualization. We present a faster algorithm here. We assume that the map cells are given by their axis-parallel...
متن کاملSolving the Multiple Instance Problem with Axis-Parallel Rectangles
The multiple instance problem arises in tasks where the training examples are ambiguous: a single example object may have many alternative feature vectors (instances) that describe it, and yet only one of those feature vectors may be responsible for the observed classi cation of the object. This paper describes and compares three kinds of algorithms that learn axis-parallel rectangles to solve ...
متن کاملEvacuation of Rectilinear Polygons
We investigate the problem of creating fast evacuation plans for buildings that are modeled as grid polygons, possibly containing exponentially many cells. We study this problem in two contexts: the “confluent” context in which the routes to exits remain fixed over time, and the “non-confluent” context in which routes may change. Confluent evacuation plans are simpler to carry out, as they allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2003
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539799358835