CGAL users discussion list

["" <>]

Dr Marc

  Thanks for reply. Following your advice, i give up on attempts to build a refined mesh in a dD-Box. But could you please offer me a example about the refined mesh in a 3D-Box.

    Your could probably start from here：

typedef CGAL::Triangulation_3        Triangulation;

typedef Triangulation::Point_3 POINT_t;

      std::vector<POINT_t> points;

      points.reserve(8);

         std::vector<std::vector<double>> d_points(8);//the vertices of a 3D-Box

  d_points[0]={1,2,3 }; d_points[1]={-1,2,3 };

d_points[2]={1,-2,3 }; d_points[3]={-1,-2,3 };  

d_points[4]={1,2,-3 }; d_points[5]={-1,2,-3 };  

d_points[6]={1,-2,-3 };d_points[7]={-1,-2,-3 };  

 int i;

for (i = 0; i < 8; ++i)  { points.push_back(POINT_t( d_points[i].begin(), d_points[i].end()));  }

Triangulation t (points.begin(), points.end());  

    …………????

  could you please tell me how to proceed next. 

                Best regards!

发自我的荣耀手机

-------- 原始邮件 --------
发件人： Marc Glisse <>
日期： 2024年3月9日周六 17:46
收件人： """ " <>
主 题： Re: [cgal-discuss] 回复： FW: The dD-Triangulation seems to be incorrect, CGAL version 5.6.1

On Sat, 9 Mar 2024, ""  wrote:

> Thank you very much！ I had reliazed that after the email was sent.     Now l’m trying to generate a finer triangularation. The current triangularaton
> seems to be containing the given vertices only.
>      Could l have a finer delauny triangulation of a dD-Box, just by these given vertices？

IIUC, you want to refine a mesh. CGAL has a lot of code to do that in
dimension 3, but I don't think it has anything in arbitrary dimension, you
will have to provide the extra points yourself.

--
Marc Glisse

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