Skip to Content.
Sympa Menu

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

Subject: CGAL users discussion list

List archive

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


Chronological Thread 
  • From: Frank Dz <>
  • To:
  • Subject: [cgal-discuss] Regular Triangulation- Quickly get the inserted vertex's incident vertices.
  • Date: Mon, 16 Dec 2019 08:25:02 -0600 (CST)
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Fail ; spf=Pass
  • Ironport-phdr: 9a23:8SISgRWMLC6QhGgfwwc+iSscXd/V8LGtZVwlr6E/grcLSJyIuqrYYhyAt8tkgFKBZ4jH8fUM07OQ7/m7HzZYvN3f6TgrS99lb1c9k8IYnggtUoauKHbQC7rUVRE8B9lIT1R//nu2YgB/Ecf6YEDO8DXptWZBUhrwOhBoKevrB4Xck9q41/yo+53Ufg5EmCexbal9IRmrowjdrNcajZdiJ6o+yxbFv2ZDdvhLy29vOV+dhQv36N2q/J5k/SRQuvYh+NBFXK7nYak2TqFWASo/PWwt68LlqRfMTQ2U5nsBSWoWiQZHAxLE7B7hQJj8tDbxu/dn1ymbOc32Sq00WSin4qx2RhLklDsLOjgk+2zRl8d+jr9UoAi5qhJxw4DafoKbOudxcazBct0XXnZBU8RNWyBdHo+wc5UDAuwcNuhYtYn9oF4OoAO+Cwm2HuzvzDxIjWL406w7zu8sFhrG0xE9H90TsXXVrM74OLoTXO271qXH0TLDb/ZP1Dr79YPGfBchofSWUrJxd8rc0U8vGBnegVqLrYzqISmZ2fgKs2ie6edrSOGhi3Y/pg1spjWiwt0gh4fKi44PyV3J9D91zYc0KNC+VUV1e8SrEIFKuCGfL4Z2Qt0tQ2VvuCsizL0LtoS3fC4Qx5s83BHfb+KIf5KU7RLkUeadOTZ4hHR7d7Kjnxu+7Eytx+nmWsS601tGtClIn9jWun0M1hHf8s2HReF8/kel1zaPzQfT6uRcLEAviKXbNoMuw78wl5cIrEjOHyH7lF/qg6+Rc0Uo4vKo5Pj/YrX6up+cMJd5hR3xMqs0nsyzGPk3MgkVX2eH5OS8z6bj8FbiQLRKi/02irPWvIrbJcQdvK65AhVa3pwt6xalXH+a14ETknADaV5EYxmalJPBOlfUIfm+A+3srU6rlWJF3fnAPfXNEN2ZNXTenKXwVe8jsAhXzw9lnoMX3I5dFrxUeKG7YUT2rtGNVkZlYTzx+P7uDZBG7q1bQXiGU/3AbviUuliNtLp2fru8IbQNsTO4EMALov7jiXhgxA0bIe+v1JEdbH3+FfNjcRzAMCjcx+wZGGJPhTIQCenjiVmMSzlWNiTrAfl67TY+Wt6r


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/



Archive powered by MHonArc 2.6.18.

Top of Page