Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am very much happy after seeing some very good answers in this site. I am trying to design a algorithm for the construction of Delaunay Triangulation using Randomized Incremental Algorithm.(I wont expect everyone to know about this one), I need to design a triangle which stores points,edges and the triangles adjacent to it,also need to maintain a parent & children relation between the triangles and also edges with two opposite points to each of it(preferably in java) . I know its a bit complicated and not easy to understand but i cant explain the whole algorithm here in this site, so i would like to find some one who is familiar with this.

Thanks in advance.

share|improve this question

1 Answer 1

up vote 3 down vote accepted

You might look at Lutz Kettner's paper, "Designing a Data Structure for Polyhedral Surfaces," (CiteSeer link). He uses the half-edge data structure. Here is CGAL's description of that structure:
      enter image description here
An alternative is the winged-edge data structure.

share|improve this answer
2  
For triangulations, you can you a simpler alternative such as described in cgal.org/Manual/latest/doc_html/cgal_manual/TDS_2/… –  lhf Feb 27 '13 at 13:05
    
I am very happy on seeing your answer thank you @Joseph –  u2425 Feb 27 '13 at 18:30

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.