Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Regular Triangulation- Quickly get the inserted vertex's incident vertices.

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Regular Triangulation- Quickly get the inserted vertex's incident vertices.


Chronological Thread 
  • From: Andreas Fabri <>
  • To:
  • Subject: Re: [cgal-discuss] Regular Triangulation- Quickly get the inserted vertex's incident vertices.
  • Date: Mon, 16 Dec 2019 16:00:12 +0100
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=None ; spf=None
  • Ironport-phdr: 9a23:Yww+6xEggCZvygaueZoiZJ1GYnF86YWxBRYc798ds5kLTJ76p8uzbnLW6fgltlLVR4KTs6sC17ON9fq4BCdesN6oizMrSNR0TRgLiMEbzUQLIfWuLgnFFsPsdDEwB89YVVVorDmROElRH9viNRWJ+iXhpTEdFQ/iOgVrO+/7BpDdj9it1+C15pbffxhEiCCybL9vIhi6txvdutUWjIdtK6s8zgbCr2dVdehR2W5mP0+YkQzm5se38p5j8iBQtOwk+sVdT6j0fLk2QKJBAjg+PG87+MPktR/YTQuS/XQcSXkZkgBJAwfe8h73WIr6vzbguep83CmaOtD2TawxVD+/4apnVAPkhSEaPDM/7WrZiNF/jLhDrRy8uRJ/zY7aboKbOvVwcazSf88VSHFbUcpNTSFMGJ+wYoUNAucHIO1Wr5P9p1wLrRamGQSsAv7gyiVWiXDsxq0xzuQvHhvd0ww6HtIFrXPZo8/zNKgPS+C60rPHzS7ZY/NYwzjy85LIchE6rPGDQ71wds/RxlczFwPfjlSQp5bqMC+J1uQKqWia7/BsWv6oi24isgx8pCWkyMkrionMnI0Vy1bE+D1/wIkvPtK3U0p7bsC+HJRMsCGaMpN6Td8tQ25yvCY20LoGuYS0fCUM1Z8pxAbfZuSIfoWJ+B7vSfqdLDdiiH9qdr+znRK//Ea4xuD4SsW4yktGojdGn9XWq3wA2Bje5tKJR/Zz5kutxSyD2xzJ5u1YO0w4iazWIIM7zLEqjJocq0HDEzf2mEroiK+WcV0p9+my5+TiZbXqu52ROoFuhgH7KKsum8i/Df0/MggTQ2iX4+O81KPj/UHjRrVFkOE2nrHYsJDcO8sbura0DgBU34o59hqzEzer3M4XkHQJNl5IfByKg5DsO17UIfD4Cfm/g06rkDdu3/3JJLvhDYjXLnfdirjhZqxx60BGxwUo19Bf5olZCr4fL/L0X0/+qsDYDgU5Mgy62enoFMl91oQEWWOPGKOWLKTSsVqQ6uI1P+aMfJMVuCr6K/U9+/HugmU2mVsEcaa03JsXc2y3Hul9I0WCenfsmdcAEWISvgUkVuDqiVuCUSRSZ3moRa486Cs7BJqjDYfEW4+inqSM3Dy+Hp1KfmBKE1eMEWr0d4mcW/cDdiaSIsh5nzwcUbiuUY8g2g+0tAPnyrdqLfDY+i0Cup7509h1+e3TmQs09TNqE8SRy2CNT2dqkWMUXzI6wLpzrVBnxlufy6R0n+RUFcZP6PNRTgc6KZncwvRmBND9QA3Bes6FR0unQtW9HT4xU8kxw8QVbkZ8HdWilBHD0DCwD78bjbyGAoE//7zY33jsPMZ912jJ1LM8gVknQ8pAK3WrirIsvzTUUoXGmkHcm6exfrkHxwbM8n2CxCyAphJ2Sgl1BIzDUWoSb1Ceg93z/EKKG7aoBa4qOxAHx8eIMKpiZdDuiFhaXubtMd/CZHig3Wy3AEDblfu3cIP2djBFj23mA08enlVLpCrUBU0FHi6k5lnmInl2D1u1OhHj/O57pW+hX0E9xB2NdVwn3L2wqEZM1K6sDsgL17dBgx8P7jB9HVKzxdXTUYPSqAdmeahAe8Iz6Vxb0njI8Qd6O874dv0wthslaw1y+njW+VB3B4FHy5Z48jUvy1MtcuSd2VJFMjSFwdb3JL2RLGTurkii

Hello,

A Regular_triangulation_3 is derived from Triangulation_3

where you can find he function:

https://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Triangulation__3.html#aa9814b11ee0a6e024fd3cee4cff066c3

best,

andreas


On 12/16/2019 3:25 PM, Frank Dz wrote:
Hi all~ I have a question for quickly get the inserted vertex's incident
vertex. To be specific, I wanna insert one weighted point to the regular
triangulation, and I just wanna focus on this just inserted vertex and try
to figure out its incident vertices in the RT (regular triangulation).

For example, before I insert vertex A, in the regular triangulation, there
are vertices B,C,D,E,F. After insertion, A is connecting to B, C, D. Now I
want to quick get vertices: B, C, D.

I have tried two method. 

1st : I use vertex handle after I insert the point. Yet vertex handle do not
provide a connecting info of this new inserted point.

2nd: I need to use iterator to first get this points and use the Edge  data
structure:

\\...
 for(RT::Vertex_iterator vit = rt.vertices_begin(); vit!= rt.vertices_end();
++vit){
      std::vector<DT::Edge> E;
      dt.incident_edges(vit,std::back_inserter(E));
\\...

If there exist the method to get this problem solved?

Thanks for your kind help and guidance!





--
Sent from: http://cgal-discuss.949826.n4.nabble.com/

-- 
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri



Archive powered by MHonArc 2.6.18.

Top of Page