Path: utzoo!attcan!uunet!mcvax!enea!kth!draken!tut!router!opmvax!hnevanlinna
From: hnevanlinna@opmvax.kpo.fi
Newsgroups: comp.graphics
Subject: 2D-triangulation
Message-ID: <11@opmvax.kpo.fi>
Date: 23 Jan 89 21:31:19 GMT
Organization: Tieteellisen Laskennan Palvelu
Lines: 16

Someone asked a few days ago for 3D-tringulation.
I would be more than happy for an efficient algorithm for
2D-triangulation.
I am familiar with algorithm, which sorts data with distance to the
middle point of two closest points ( actually did it with object pascal
in Mac ), but triangles made were not satisfactory. I know, there
exist an algorith starting with poine, and searching more ching more points
inside this circle, but how it's done in Nlog(n), is beyond my imagination.

So do you know source for this algorith or other.
                                                            
	Jouni Rynv, Finish Meteorological Institute, Dep. of Geophysics

	(doing graduate work on macnetic maps with irregular
	 measument points)