On Tue, 23 Mar 2010, Jim Lemon wrote:
> On 03/23/2010 10:23 AM, Ray Brownrigg wrote:
> > ...
> >
> > How about less than 2 seconds? [And 500 points in less than 15 seconds -
> > on a 2-year-old DELL Optiplex GX755.]
> >
> > The implementation below (at end) loops over all 'feasible' pairs of x
> > values, then selects the largest rectangle for each pair, subject to your
> > specified constraints.  I have no idea if it implements a previously
> > published algorithm.
> >
> > Other constraints are reasonably easily accommodated.
>
> This is brilliant! May I use this algorithm, attributed to you of
> course, to improve the emptyspace function?
>
Yes, of course, but note my subsequent correction.

Ray

______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.

Reply via email to