Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] The exact algorithm and references of CGAL's 3DDelaunay function

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] The exact algorithm and references of CGAL's 3DDelaunay function


Chronological Thread 
  • From: "????" <>
  • To: "cgal-discuss" <>
  • Subject: Re: [cgal-discuss] The exact algorithm and references of CGAL's 3DDelaunay function
  • Date: Tue, 26 Jul 2016 18:15:56 +0800
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=Pass
  • Ironport-phdr: 9a23:fejciR9HiibH6f9uRHKM819IXTAuvvDOBiVQ1KB92u8cTK2v8tzYMVDF4r011RmSDN2dtakP0ruempujcFRI2YyGvnEGfc4EfD4+ouJSoTYdBtWYA1bwNv/gYn9yNs1DUFh44yPzahANS47AblHf6ke/8SQVUk2mc1EkfqKrQcWL3oye7KObw9XreQJGhT6wM/tZDS6dikHvjPQQmpZoMa0ryxHE8TNicuVSwn50dxrIx06vrpT4wZh47i4Fu+4979USFuLhbqEgRPpZCi4nOiY7/orwpBzbREyO4HUbFW4Zmx4NDwne5wzhRcTNtX6wveV03GyWPNb9UKsvE3z25KhiTFrkiTwMKiUi2GDRkM15yqxB9kGPvRt6lsRx/R9UfrIqJ/uHJIlFFDscBO5ITmpKBYbqPNhHNPYIIesN99q1nFAJtxbrXQQ=

 Hi Monique,
Thank you for your kind advice.
 I will learn delaunay of CGAL with the references as you mentioned. For CGAL code, I just searched in the CGAL directory about delaunay and find many related files with .h extension. So, can you recommend the target program files that contain the detail of the algorithm implementation of 3d delaunay. 

Best wishes! 


------------------ Original ------------------
From:  "Monique Teillaud";<>;
Date:  Tue, Jul 26, 2016 02:43 PM
To:  "cgal-discuss"<>;
Subject:  Re: [cgal-discuss] The exact algorithm and references of CGAL's 3DDelaunay function

Hi,

Thank you for your nice email.

Though the basic incremental algorithm used is very standard (see e.g., Bowyer 1981), the 3d Delaunay triangulation of CGAL is the result of quite a long research process, in particular on robustness issues. You can find a few references here https://members.loria.fr/Monique.Teillaud/biblio/Keyword/CGAL_.html but they are not the only ones.

If you want to know more about the details of the implementation, well, the CGAL source code is public??

Best regards,
--
Monique Teillaud 
https://members.loria.fr/Monique.Teillaud/
INRIA Nancy - Grand Est, LORIA 
Institut National de Recherche en Informatique et Automatique


Hi,
I am learning geometric modelling and I want to do some research on 3D
Delaunay. I just tried 3d delaunay function  provided by CGAL and was
impressed by its high efficiency. I implemented 3D delaunay myself with
Incremental  Insertion Algorithms, but the efficiency was much less than
CGAL.
In addition, it needs to add eight auxiliary bounding points before point
insertion during 3D Delaunay  triangulation. In my program, the coordinates
of the eight points was configured with the rules that the bounding  box
formed by the eight points can contain the whole point set. But the
triangulation result is a bit different on  surface compared with 3D
delaunay of CGAL.

So, I wonder how to find the exact algorithm and references of CGAL's 3D
delaunay function.

Thanks for any help.



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/The-exact-algorithm-and-references-of-CGAL-s-3D-Delaunay-function-tp4662096.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss






Archive powered by MHonArc 2.6.18.

Top of Page