eloraiby / delaunay

Relatively Robust Divide and Conquer 2D Delaunay Construction Algorithm in $O(n \log n)$
GNU Affero General Public License v3.0
126 stars 34 forks source link

[Feature Request] - Java implementation #6

Open tsvvladimir opened 9 years ago

tsvvladimir commented 9 years ago

Hi! I'm not sure that it is the issue, but did you tried to implement yours Divide and Conquer delaunay algorithm in java? It'll be very helpful for me. Thanks!

eloraiby commented 9 years ago

Will add it as a feature request!

bast commented 7 years ago

I don't think the code should be rewritten to Java. And I am not a Java expert but in my limited understanding it should be no problem to call a C library out of Java if needed.

eloraiby commented 7 years ago

@bast: even if it's in C, it still need to have java/jvm binding :)

bast commented 7 years ago

Good point.