Re: List processing
- To: mathgroup at smc.vnet.net
- Subject: [mg37210] Re: List processing
- From: "Steve Luttrell" <luttrell at _removemefirst_westmal.demon.co.uk>
- Date: Thu, 17 Oct 2002 00:08:26 -0400 (EDT)
- References: <aokbp7$afv$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Interval[{100, 200}, {150, 250}, {120, 270}, {300, 400}] does what you want.
--
Steve Luttrell
West Malvern, UK
"John Leary" <leary at paradise.net.nz> wrote in message
news:aokbp7$afv$1 at smc.vnet.net...
> Greetings
>
> This problem can be solved by conventional programming, but I wonder if
> there is an elegant Mathematica solution ?
>
> A list contains pairs of values, with each pair representing the lower and
> upper edge of a sub-range. Some of the sub-ranges partially overlap, some
> fully overlap, others don't overlap at all. The problem is to produce a
> second list that contains the overall upper and lower edges of the
> overlapping sub-ranges.
>
> A simple example : {{100,200},{150,250},{120,270},{300,400}} would
result
> in {{100,270},{300,400}}.
>
> In the real case, the input list has several hundred elements and the
> output list typically has five elements.
>
> I have a working solution based on loops, but there must be a more elegant
> one. I would be very grateful for any suggestions.
>
>
> Best regards
>
> John Leary
>
>