On 28 Aug 2017, at 13:13, Val <delepl...@gmail.com> wrote: > > To achieve this, I consider normalizing the triplet so that all keys of the > map verify > A < B < C > for some arbitrary definition of < . This ensures that I can detect any > Triangle already present as key in the map, regardless the order of its > Vertex pointers.
Can't you sort the Vertex slice by their X,Y,Z position? (You're then not relying on the coordinates for identity, only for order. This breaks for triangles that are actually lines or points, which may or may not be an issue and can be handled separately...) //jb -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
