CORR

2010

Springer

12 years 11 months ago
2010

Springer

Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...

COMGEO

2011

ACM

12 years 11 months ago
2011

ACM

For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...

JCT

2006

13 years 4 months ago
2006

We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...

ESA

2010

Springer

13 years 5 months ago
2010

Springer

We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...

CCCG

1997

13 years 5 months ago
1997

Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...

WSCG

2003

13 years 5 months ago
2003

This paper presents a probability method for detecting people in a static image. We simplify people as a torso and four limbs. The torso is fitted by a quadrangle, and each limb i...

STACS

1990

Springer

13 years 8 months ago
1990

Springer

We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...

COCOA

2009

Springer

13 years 9 months ago
2009

Springer

Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...

SWAT

2004

Springer

13 years 9 months ago
2004

Springer

Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...

COCOON

2005

Springer

13 years 9 months ago
2005

Springer

Abstract. We consider the number of diﬀerent ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...