Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

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

Open
GoogleCodeExporter opened this issue May 23, 2015 · 3 comments
Open

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

GoogleCodeExporter opened this issue May 23, 2015 · 3 comments

Comments

@GoogleCodeExporter
Copy link

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 [email protected] on 22 Apr 2015 at 1:22

Attachments:

@GoogleCodeExporter
Copy link
Author

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 [email protected] on 22 Apr 2015 at 2:13

@GoogleCodeExporter
Copy link
Author

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 [email protected] on 22 Apr 2015 at 2:45

@GoogleCodeExporter
Copy link
Author

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 [email protected] on 22 Apr 2015 at 3:22

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant