Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2010
Springer
75views Education» more  CORR 2010»
11 years 1 months ago
Treemaps with Bounded Aspect Ratio
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 ...
Mark de Berg, Bettina Speckmann, Vincent van der W...
COMGEO
2011
ACM
11 years 1 months ago
Covering points by disjoint boxes with outliers
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...
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin...
JCT
2006
60views more  JCT 2006»
11 years 6 months ago
On the number of rectangulations of a planar point set
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...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
ESA
2010
Springer
273views Algorithms» more  ESA 2010»
11 years 7 months ago
Minimum Vertex Cover in Rectangle Graphs
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...
Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz
CCCG
1997
11 years 8 months ago
Label placement by maximum independent set in rectangles
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...
Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...
WSCG
2003
101views more  WSCG 2003»
11 years 8 months ago
Probability Estimation for People Detection
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...
Qingjie Sun, Enhua Wu
STACS
1990
Springer
11 years 10 months ago
Approximation of Convex Figures by Pairs of Rectangles
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...
Otfried Schwarzkopf, Ulrich Fuchs, Günter Rot...
COCOA
2009
Springer
11 years 11 months ago
Variable-Size Rectangle Covering
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 ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
12 years 2 days ago
Maximizing the Number of Packed Rectangles
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...
Klaus Jansen, Guochuan Zhang
COCOON
2005
Springer
12 years 7 days ago
An Upper Bound on the Number of Rectangulations of a Point Set
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
books