From: mert0407 AT sable DOT ox DOT ac DOT uk (George Foot)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Searching for a very specific algorithm
Date: 30 May 1997 03:55:49 GMT
Organization: Oxford University, England
Lines: 12
Message-ID: <5mlj45$fb2@news.ox.ac.uk>
References: <338E2DAE DOT F88C30E AT sercomtel DOT com DOT br> <5mli2t$fb2 AT news DOT ox DOT ac DOT uk>
NNTP-Posting-Host: sable.ox.ac.uk
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

George Foot (mert0407 AT sable DOT ox DOT ac DOT uk) wrote:

: This isn't really on-topic, but anyway... In 2D, given coordinates as X-Y
: pairs you would, for each pair of adjacent points p[m] and p[n] calculate
...

On rereading this, I think I should say that you should make n=m+1, or
zero if m is the last point.

-- 
George Foot <mert0407 AT sable DOT ox DOT ac DOT uk>
Merton College, Oxford