Comments on: an approach to triangulating polygons with holes http://www.sakri.net/blog/2009/06/12/an-approach-to-triangulating-polygons-with-holes/ I Flash und I Flex Jaaaa Sat, 31 Jul 2010 00:10:09 +0000 http://wordpress.org/?v=2.6.2 By: sakri http://www.sakri.net/blog/2009/06/12/an-approach-to-triangulating-polygons-with-holes/#comment-1252 sakri Fri, 11 Sep 2009 15:04:08 +0000 http://www.sakri.net/blog/?p=352#comment-1252 Thanks for that Jelle. I only tried this out on "letter shapes", so I guess that doesn't qualify as extensive testing ;) Good to know... Thanks for that Jelle. I only tried this out on “letter shapes”, so I guess that doesn’t qualify as extensive testing ;) Good to know…

]]> By: Jelle http://www.sakri.net/blog/2009/06/12/an-approach-to-triangulating-polygons-with-holes/#comment-1251 Jelle Fri, 11 Sep 2009 14:59:49 +0000 http://www.sakri.net/blog/?p=352#comment-1251 I discovered a weaknesses in your 'choping of holes' approach. It is not checked that other points of the hole are 'in' the chopping area. For example: take a square polygon (only 4 points on the corner) and a circular hole in it with lots of points, near one of the corners of the square. The choping 'area' is quite big as it will span one side of of the square and will include multiple points of the circle. In this is case, looking for the shorest connection is not enough. A possible candicate connection must be checked on intersection with other points. A second problem: say I have two holes, hole 1 and hole 2. Hole 2 is in the path of the shortest connection between hole 1 and the polygon... I discovered a weaknesses in your ‘choping of holes’ approach. It is not checked that other points of the hole are ‘in’ the chopping area. For example: take a square polygon (only 4 points on the corner) and a circular hole in it with lots of points, near one of the corners of the square. The choping ‘area’ is quite big as it will span one side of of the square and will include multiple points of the circle. In this is case, looking for the shorest connection is not enough. A possible candicate connection must be checked on intersection with other points.

A second problem: say I have two holes, hole 1 and hole 2. Hole 2 is in the path of the shortest connection between hole 1 and the polygon…

]]> By: sakri http://www.sakri.net/blog/2009/06/12/an-approach-to-triangulating-polygons-with-holes/#comment-1243 sakri Thu, 30 Jul 2009 14:33:48 +0000 http://www.sakri.net/blog/?p=352#comment-1243 hi makc, No, I haven't tried it. I don't see why it wouldn't work though. I guess it would take a couple of steps. First, you'd need to convert any curves into multiple line segments. Then create a vector of points from the shapes, in such a way that you pass the "container" and the "hole" correctly into the function. These guys seem have those steps covered, only they use an alchemy port for the triangulating: http://blog.barcinski-jeanjean.com/2009/01/07/text-extrusion-and-triangulation-experiments/ hi makc,

No, I haven’t tried it. I don’t see why it wouldn’t work though. I guess it would take a couple of steps. First, you’d need to convert any curves into multiple line segments. Then create a vector of points from the shapes, in such a way that you pass the “container” and the “hole” correctly into the function.

These guys seem have those steps covered, only they use an alchemy port for the triangulating:

http://blog.barcinski-jeanjean.com/2009/01/07/text-extrusion-and-triangulation-experiments/

]]> By: makc http://www.sakri.net/blog/2009/06/12/an-approach-to-triangulating-polygons-with-holes/#comment-1242 makc Thu, 30 Jul 2009 14:20:26 +0000 http://www.sakri.net/blog/?p=352#comment-1242 did you tried this with sepiroth true type parser rather than with marching squares trick? did you tried this with sepiroth true type parser rather than with marching squares trick?

]]>