Sciweavers

TPDS
2002
136views more  TPDS 2002»
13 years 4 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
JCT
2007
90views more  JCT 2007»
13 years 5 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 5 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
CCCG
2010
13 years 6 months ago
Bounded-degree polyhedronization of point sets
In 1994 Gr
Gill Barequet, Nadia Benbernou, David Charlton, Er...