[Algorithms] Res: Res: Res: Polygon from point cloud and other from triangle list?
Brought to you by:
vexxed72
|
From: Jose M. <jos...@ya...> - 2009-06-26 13:17:17
|
Think on a Tangram game. The pieces aren't overlapping. They are all convex, but the resulting image can be non-convex. I need to determinate the union of the shapes, creating a polygon of the resulting image. For example, if the pieces are forming a rectangle, the resulting polygon has four line segments, the outline of that rectangle. If the pieces are forming a rabbit, I need to determinate the polygon (or polygons) of the outline of the rabbit. ----- Mensagem original ---- De: Jon Watte <jw...@gm...> Para: Game Development Algorithms <gda...@li...> Enviadas: Quinta-feira, 25 de Junho de 2009 17:26:39 Assunto: Re: [Algorithms] Res: Res: Polygon from point cloud and other from triangle list? Jose Marin wrote: > Yes, polygon union! > > I should have done more research before posting, so the description of the problem would be more clear. > > I have found some libraries that do that, but all that I need is a simple algorithm to compute the union, not a full feature geometry library. > > Are your polygons already overlapping, and all you need to do is ensure no self-overlap in the output? Or do you not need the final union to be fully connected using non-degenerate faces? Sincerely, jw -- Revenge is the most pointless and damaging of human desires. ------------------------------------------------------------------------------ _______________________________________________ GDAlgorithms-list mailing list GDA...@li... https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list ____________________________________________________________________________________ Veja quais são os assuntos do momento no Yahoo! +Buscados http://br.maisbuscados.yahoo.com |