-4

I found on web this algorithm http://goanna.cs.rmit.edu.au/~gl/research/comp_geom/delaunay/delaunay.html but it is written in C. Is there a way to convert it to java? Or could you suggest divide and conquer delaunay triangulation in java? I've tried Novosoft, C2J and Tangible Software Solutions, C++2Java converters but they provide very complex code(I mean that I have to do a lot of manual work to make it work). I read about mtSystems converter but I can't found it on the web to try. I'll appreciate any help with converting or with algorithm itself.

Vladimir
  • 21
  • 8
  • 2
    If you scrolled down to the page, you would see [this java source code](http://goanna.cs.rmit.edu.au/~gl/classes/TriangulationApplet.java). It is the source code of the applet, but you can *easily* extract algorithm out of it. – Willem Van Onsem Jun 07 '15 at 15:44
  • @CommuSoft as you can see in applet source code description "The Triangulator - a java applet which animates some brute force * Delaunay triangulation algorithms". – Vladimir Jun 07 '15 at 15:49
  • Well both the applet and the C code show the *O(n^2)*, *O(n^3)* and *O(n^4)* algorithm. The sweepline algorithm is - as far as I know - not part of the C code. – Willem Van Onsem Jun 07 '15 at 15:54
  • @CommuSoft I don't need sweep line, I need divide and conquer. It's complexity is lower and also I need to do some research about parallelism. – Vladimir Jun 07 '15 at 15:58
  • 1
    divide and conquer is *nearly* always *O(n log n)*, *n* for processing on a certain level and *log n* for the number of levels. The same holds for [triangulation](http://en.wikipedia.org/wiki/Delaunay_triangulation#Divide_and_conquer). – Willem Van Onsem Jun 07 '15 at 16:00
  • @CommuSoft Sorry, what does it mean? All I want is divide and conquer implementation, at lest, cuz I need to compare with algorithms I've already implemented. – Vladimir Jun 07 '15 at 16:03

1 Answers1

2

You can try an incremental algorithm for example from Paul Bourke:http://paulbourke.net/papers/triangulate/. Its also very fast but especially easier to understand.

Micromega
  • 12,486
  • 7
  • 35
  • 72