Re: sorting by comparing two nodes

You need the sort key to be a total order in order in order for the
sort to be well defined. I don't think your suggested comparison does
give a total order.

It seems you just need to sort the points in
order of angle so within one quadrant you can just sort on tangent
(p.y-z.y)/(p.x-z.x) together with some sorts to order the quadrants,
so you only need data from one point at a time, which you should be able
to express as one or more xsl:sort instructions easily enough.

David


________________________________________________________________________
This e-mail has been scanned for all viruses by Star. The
service is powered by MessageLabs. For more information on a proactive
anti-virus service working around the clock, around the globe, visit:
http://www.star.net.uk
________________________________________________________________________