daveinengland at gmail.com
Sat Jan 30 17:05:51 EST 2010
I got the paper and it didn't have a whole algorithm in it, but it did clear
up a huge misperception I had. I thought that quad edges were edges of
quadrangles, not a good way to describe any edge. I had avoided this whole
library because I was using mostly triangles. D'oh!
On Sun, Jan 24, 2010 at 8:46 PM, Edward Lam <edward at sidefx.com> wrote:
> On Sun, January 24, 2010 08:54, Mark Elendt wrote:
> > You can look at either the GQ library or maybe GEO_PointRefArray.
> > Both build additional topological information.
> > With a GQ detail you can traverse edges to find edges that don't have
> > pairs (i.e. a boundary edge).
> > It's more work to do it with a point ref array.
> FYI, the purpose of the original paper that GQ_Detail is based upon had
> an elegant algorithm for creating convex hulls. However, I'm not sure if
> GQ_Detail implemented enough of it to simply use the algorithm mentioned
> in the paper (it might).
> 1. The paper reference can be found in GQ_Detail.h.
> Sidefx-houdini-list mailing list
> Sidefx-houdini-list at sidefx.com
More information about the Sidefx-houdini-list