I'm using Delaunay to triangulate a concave polygon, but it fills in the concavities. How do I automatically remove the trian开发者_StackOverflowgles that are outside the polygon boundaries?
Self-answer: in some cases, this is impossible. I needed to use a constrained Delaunay algorithm: http://www.cs.cmu.edu/~quake/triangle.delaunay.html
You shouldn't, you should find a Delauney routine that handles boundaries correctly.
Alternately you could, assuming you know the edges, go through every triangle and delete those that cross an edge. Search for segment-segment interestion tests for code to do this.
 
         
                                         
                                         
                                         
                                        ![Interactive visualization of a graph in python [closed]](https://www.devze.com/res/2023/04-10/09/92d32fe8c0d22fb96bd6f6e8b7d1f457.gif) 
                                         
                                         
                                         
                                         加载中,请稍侯......
 加载中,请稍侯......
      
精彩评论