search

artem-ogre / CDT

Constrained Delaunay Triangulation (C++)
https://artem-ogre.github.io/CDT/
Mozilla Public License 2.0
947 stars 125 forks source link

Some triangles have circumcenters of other triangles #130

Closed Hotege closed 1 year ago

Hotege commented 1 year ago

err1

According to the definition of delaunay triangulation, each triangle has only one circumcenter of itself. But what CDT triangulates seems wrong. The circumcenter(with color = RGB(0xFF, 0, 0xFF)) of triangle(2, 10, 20) locates in the triangle(10, 13, 20). The algorithm of CDT didn't explain it.

Those points are following: 195.161837,34.843706 130.032650,70.837227 239.184375,134.011025 20.007275,102.818517 165.609416,133.327198 107.316190,175.305884 279.682453,80.494892 9.044889,220.765781 54.535598,33.363571 103.076972,284.033114 225.705335,214.024568 204.949463,279.304081 317.158837,302.974040 310.393828,235.784961 378.266154,168.994838 379.576980,255.729917 155.482705,227.629750 312.859411,17.631993 392.947989,100.805577 412.960285,34.874497 313.437276,143.280369 39.790285,298.609137

Hotege commented 1 year ago

sorry, I've made mistakes on the definition. please ignore me.