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));

\\...

The second method can solve the problem, but it is too slow. I want to know

it there exist a method it running time is almost O(c) rather than O(n) due

to a loop.

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/--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://sympa.inria.fr/sympa/info/cgal-discuss
be open, be creative, be critical