sp-mishra / poly2tri

Automatically exported from code.google.com/p/poly2tri
Other
0 stars 0 forks source link

[java] Missing triangle in non-constrained delaunay #105

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago
What steps will reproduce the problem?
1. Execute non-constrained delaunay of the following points:
4 7
3.2 4.6
4.1 5.2
6 5

What is the expected output? What do you see instead?

Expected output of 3 triangles. Got 2 triangles.

What version of the product are you using? On what operating system?
Last snapshot version

Please provide any additional information below.
Js version of poly2tri does not give use the opportunity to test non 
constrained delaunay.

Original issue reported on code.google.com by fnicola...@gmail.com on 22 Apr 2015 at 1:22

Attachments:

GoogleCodeExporter commented 9 years ago
Yeah if I remembered correctly the insurance that a point triangulation is 
convex is not 100% :(. The lib was written as a polygon triangulator and this 
was not considered.

Depending on your usage maybe you could start of with a rectangle polygon and 
add your points as steinerpoints. Then you are ensured that the triangulation 
is convex.

Original comment by thahlen@gmail.com on 22 Apr 2015 at 2:13

GoogleCodeExporter commented 9 years ago
Hi,

Good to know..

The usage is to write unit test in poly2tri to make sure if this library create 
valid delaunay triangulation, before adding refinement.

I will try to dig with the function turnAdvancingFrontConvex..

Original comment by fnicola...@gmail.com on 22 Apr 2015 at 2:45

GoogleCodeExporter commented 9 years ago
Does this comment in the code have a relation with this issue ?

DTSweep.java
// TODO: implement ConvexHull for lower right and left boundary

Original comment by fnicola...@gmail.com on 22 Apr 2015 at 3:22