RE: [Algorithms] merging of points in 3D space

[Gareth L. <GL...@cl...>]

> 
> I think this is the "trivial algorithm" Peter was originally 
> referring to :)
> 

Shame on me! I missed that part. Ok here goes.

Got this idea from Pierre. Push your points thru your collision engine. Set
a sphere around each point and merge all colliding vertices.

Another option is to sort by just a single axis ( Say the x ) and the run
"the trivial" algorithm on blocks. So run it on every 10 verts steping only
1 forward

So test 0..10 against each other
then 1..11 

etc.


_______________________
Regards, Gareth Lewin
Programmer, Climax Solent.

(To anyone outside Climax, sorry for the disclaimer below)


DISCLAIMER: Unless otherwise expressly stated, this message does not create
or vary any contractual relationship between you and Climax Development Ltd.
The contents of this e-mail may be confidential and if you have received it
in error, please delete it from your system, destroy any hard copies and
contact the originator of the email. In accordance with the
Telecommunications (Lawful Business Regulations) (Interception of
Communications) Regulations 2000 the Company reserves the right and, may at
any time, monitor and intercept (but not record) e-mails to establish if
they are relevant to its business.