Re: [Jts-topo-suite-user] Triangulating polygons?
Brought to you by:
dr_jts
From: Martin D. <mtn...@te...> - 2010-04-24 04:43:05
|
Ok, great. Let us know how it goes. There's an obvious brute-force n^2 algorithm for finding the shortest connector between all holes and the current shell. This can be improved by indexing the vertices of the current shell and running a tree-traversal nearest-neighbour algorithm using the index. I can provide more details and maybe even a framework for doing this, once the basic algorithm has been written. Michael Bedward wrote: > Thanks for the tip Martin. I'll try implementing the second idea. > > Ian, have you already tried the C code ? I'll defer looking at it > until after having a go myself. > > Michael > > ------------------------------------------------------------------------------ > _______________________________________________ > Jts-topo-suite-user mailing list > Jts...@li... > https://lists.sourceforge.net/lists/listinfo/jts-topo-suite-user > > |