CDT: A case that failed in triangulation
I encountered some failed cases that said “Duplicate vertex detected: # is a duplicate of #”. After checking it, I found it’s because of the triangulation at the last iteration in my codes. There is a simple example below. It’s kind of like #166. I don’t know the reason, is it a bug or due to invalid points?
The vertices are
0 0.000010000000 0.000010000000
1 1.000000000000 0.000000000000
2 0.999990000000 0.099990000000
3 0.000000000000 0.100000000000
4 0.500005000000 0.000005000000
5 0.500000000000 0.050000000000
6 0.499995000000 0.099995000000
The generated triangles are
5 0 4
0 5 3
5 2 6
2 3 6
3 5 6
2 5 1
4 1 5
The triangle (2, 3, 6) is the red line, a flat triangle.
About this issue
- Original URL
- State: closed
- Created 3 months ago
- Comments: 20 (13 by maintainers)
For the (2, 3, 6) case both predicates agree that points are collinear with
O3
. My guess is that ifOfast
flag is removed, the triangulation will not contain flat triangles.you mean to print the double value with full precision?
output: