Minimum k-adjacent rectangles of orthogonal polygons and its application - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Minimum k-adjacent rectangles of orthogonal polygons and its application

(1)
1

Abstract

This paper presents the problem of partitioning a rectangle R which contains several non-overlapping orthogonal polygons, into a minimum number of rectangles. By introducing maximally horizontal line segments of largest total length, the number of rectangles intersecting with any vertical scan line over the interior surface of R is less than or equal to k, a positive integer. Our methods are based on a construction of the directed acyclic graph G = (V,E) corresponding to the structures of the orthogonal polygons contained in R. According to this, it is easy to verify whether a horizontal segment can be introduced in the partitioning process. It is demonstrated that an optimal partition exists if only if all path lengths from the source to the sink in G are less than or equal to k+1. Using this technique, we propose two integer program formulations with a linear number of constraints to find an optimal partition. Our goal is motivated by a problem involving utilization of memory descriptors applying to a memory protection mechanism for the embedded systems. We discuss our motivation in greater details.
Not file

Dates and versions

cea-01837010 , version 1 (12-07-2018)

Identifiers

Cite

T.-H. Nguyen. Minimum k-adjacent rectangles of orthogonal polygons and its application. 2nd International Conference on Computer Science, Applied Mathematics and Applications, May 2014, Budapest, Hungary. pp.75-86, ⟨10.1007/978-3-319-06569-4_5⟩. ⟨cea-01837010⟩

Collections

CEA DRT LIST DSCIN
11 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More