Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to do 3D constrained Delaunay triangulation using CGAL

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to do 3D constrained Delaunay triangulation using CGAL


Chronological Thread 
  • From: 郑银河 <>
  • To:
  • Subject: Re: [cgal-discuss] How to do 3D constrained Delaunay triangulation using CGAL
  • Date: Thu, 29 Oct 2015 09:45:51 -0700
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:4nsh/RTtvGugzQwYN1rCF/8Lfdpsv+yvbD5Q0YIujvd0So/mwa64ZxSN2/xhgRfzUJnB7Loc0qyN4/2mAD1LscfJmUtBWaIPfidNsd8RkQ0kDZzNImzAB9muURYHGt9fXkRu5XCxPBsdMs//Y1rPvi/6tmZKSV3BPAZ4bt74BpTVx5zukbviptuKMk4Y1XKUWvBbElaflU3prM4YgI9veO4a6yDihT92QdlQ3n5iPlmJnhzxtY+a9Z9n9DlM6bp6r5YTGfayQ6NtRrNRCHEqMns++dbwnRjFVwqGoHUGAUsMlR8d+/A9pEXwQ5LwtCTjt/dV1yyTPMmwRrcxD2fxp5x3QQPl3X9UfwUy93va35R9

Thank you for the reminder @ Olivier Devillers.
I find a package called Tetgen on the web, which can generate the CDT
by adding extra points.
However, that package is implemented using float point number
arithmetic. I am trying to reimplement that package using the exact
arithmetic interface provided in CGAL

2015-10-29 1:11 GMT-07:00 Olivier Devillers
<>:
>
>
> Le 29/10/15 04:17, 郑银河 a écrit :
>
> Thanks for your kind replies.
> Finally, I am planning to implement this feature by my self to solve my
> problem.
>
>
> A constrained DT does not always exist in 3D
> (there exists polyhedra that cannot be triangulated using the prescribed
> edges (or faces)
> without adding new vertices [ Schönhardt polyhedron] ).
>
>



Archive powered by MHonArc 2.6.18.

Top of Page