Mailing-List: contact batik-dev-help@xmlgraphics.apache.org; run by ezmlm
Precedence: bulk
Reply-To: batik-dev@xmlgraphics.apache.org
Received-SPF: pass (asf.osuosl.org: local policy)
Date: Sun, 12 Feb 2006 10:01:32 +1100
From: Cameron McCormack <cam-batik-dev@aka.mcc.id.au>
To: batik-dev@xmlgraphics.apache.org
Subject: Re: [Graphic]How to minimize a head movement when we just have a list
 of points and need to draw the bitmap again
Message-ID: <20060211230132.GA25870@port.mcc.id.au>
Mail-Followup-To: batik-dev@xmlgraphics.apache.org
References: <43EE59B4.5030109@gmail.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <43EE59B4.5030109@gmail.com>
User-Agent: Mutt/1.5.10i

Hi Legolas.

Legolas Woodland:
> Thank you for reading my post , and Im sorry if this place is not 
> suitable place for this question

Probably not the right place, but no matter...

> Now i should find an algorithm or method to sort those X,Y points in a 
> way that head movement become minimum.
> is there such algorithm around ?

This general problem is the Travelling Saleseman Problem[1,2], which
unfortunately is NP hard.  You may have luck with some heuristic
algorithms that result in a "good" solution, but still not minimal.

Cameron

[1] http://en.wikipedia.org/wiki/Traveling_salesman_problem
[2] http://mathworld.wolfram.com/TravelingSalesmanProblem.html

-- 
 Cameron McCormack			ICQ: 26955922
 cam (at) mcc.id.au			MSN: cam (at) mcc.id.au
 http://mcc.id.au/			JBR: heycam (at) jabber.org

---------------------------------------------------------------------
To unsubscribe, e-mail: batik-dev-unsubscribe@xmlgraphics.apache.org
For additional commands, e-mail: batik-dev-help@xmlgraphics.apache.org