Results 1  10
of
90
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
, 1991
"... In this paper we face the problem of computing a conservative approximation of a set of isothetic rectangles in the plane by means of a pair of enclosing isothetic rectangles. We propose an O(n log n) time algorithm for finding, given a set M of n isothetic rectangles, a pair of isothetic rectangles ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
rectangles (s; t) such that s and t enclose all rectangles of M and area(s) + area(t) is minimal. Moreover we prove an O(n log n) lower bound for the onedimensional version of the problem. 1 Introduction Computing approximated, concise representations of complex shapes is a standard problem in computer
MinimumArea Drawings of . . .
, 2011
"... A straightline grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straightline segment. The height, width and area of such a drawing are respectively the height, width and area of the smallest axisali ..."
Abstract
 Add to MetaCart
aligned rectangle on the grid which encloses the drawing. A minimumarea drawing of a plane graph G is a straightline grid drawing of G where the area is the minimum. It is NPcomplete to determine whether a plane graph G has a straightline grid drawing with a given area or not. In this paper we give a polynomial
Xutong NIU, Rongxing LI & Morton O’Kelly TRUCK DETECTION FROM AERIAL PHOTOGRAPHS
"... This paper presents a method for extraction and recognition of trucks from aerial photographs. A new method, mean shift image segmentation, is employed to extract truck shadow and boundary information. After a conversion of the boundaries into vector data, an enclosing minimum area rectangle is fit ..."
Abstract
 Add to MetaCart
This paper presents a method for extraction and recognition of trucks from aerial photographs. A new method, mean shift image segmentation, is employed to extract truck shadow and boundary information. After a conversion of the boundaries into vector data, an enclosing minimum area rectangle is fit
Solving geometric problems with the rotating calipers
, 1983
"... Shamos [1] recently showed that the diameter of a convex nsided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several se ..."
Abstract

Cited by 147 (11 self)
 Add to MetaCart
include (1) finding the minimumarea rectangle enclosing a polygon, (2) computing the maximum distance between two polygons, (3) performing the vectorsum of two polygons, (4) merging polygons in a convex hull finding algorithms, and (5) finding the critical support lines between two polygons. Finding
MinimumArea Drawings of Plane 3Trees (Extended Abstract)
"... A straightline grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straightline segment. The area of such a drawing is the area of the smallest axisaligned rectangle on the grid which encloses the draw ..."
Abstract
 Add to MetaCart
the drawing. A minimumarea drawing of a plane graph G is a straightline grid drawing of G where the area of the drawing is the minimum. Although it is NPhard to find minimumarea drawings for general plane graphs, in this paper we obtain minimumarea drawings for plane 3trees in polynomial time
MinimumArea hv Drawings Binary Trees (Extended Abstract)
"... Abstract. We study the area requirement of hv drawings of complete binary trees. An hv drawing of a binary tree t is a drawing of t such that (a) nodes are points with integer coordinates, (b) each edge is either a rightwardhorizontal or a downwardvertical straightline segment from a node to on ..."
Abstract
 Add to MetaCart
of t is equal to (a) 2.5n 4.5 (X/ ~ 1)/2} 3.5 if h is odd, (b) 2.5n 3.25v/n + 1 + 3.5 otherwise. As far as we know, this is one of the few examples in which a closed formula for the minimumarea drawing of a graph has been explicitly found. Furthermore this minimumarea hv drawing can be constructed
Rotational Polygon Overlap Minimization
 Computational Geometry: Theory and Applications
, 1997
"... An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1 ; P2 ; P3 ; : : : ; Pk in a container polygon C, translate and rotate the polygons to a layout that minimizes an overlap measure. A (local) overlap minimum has the property that ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
length, fixedwidth rectangle or inside a minimum area rectangle. All of these algorithms have important i...
VLSI module placement based on rectanglepacking by the sequence pair
 IEEE TRANS. ON CAD
, 1996
"... The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing ..."
Abstract

Cited by 131 (7 self)
 Add to MetaCart
The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing
Search strategies for rectangle packing
 of Lecture Notes in Computer Science
, 2008
"... Abstract. Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of realworld settings. For example, in electronic design automati ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Abstract. Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of realworld settings. For example, in electronic design
Hilbert Rtree: An Improved Rtree Using Fractals
 Proceedings 20th VLDB Conference
, 1994
"... We propose a new Rtree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in Rtrees. This is done by proposing an ordering on the Rtree nodes. This ordering has to be 'good', in the sense that it should group 'simil ..."
Abstract

Cited by 223 (11 self)
 Add to MetaCart
;similar ' data rectangles together, to minimize the area and perimeter of the resulting minimum bounding rectangles (MBRs). Following [19] we have chosen the socalled '2Dc ' method, which sorts rectangles according to the Hilbert value of the center of the rectangles. Given the ordering, every
Results 1  10
of
90