Re: [Algorithms] Sorting polys

[Mark W. <mwa...@to...>]

You could try using a hash table indexed on a quantized z-depth.
Intersecting polys present a bit of a problem - perhaps a dynamic
form of BSP with pooled nodes to avoid dynamic allocation overhead.

Mark

----- Original Message ----- 
From: "Stefano 'Panda' Baraldi" <pa...@in...>
To: "ALGORITHMS" <alg...@3d...>
Sent: Friday, September 08, 2000 4:24 AM
Subject: [Algorithms] Sorting polys


> Hi, i need to sort polygons for alpha blended objects.
> Can you point me to some resource to do that?
> 
> thank you
> 
> 
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list