CGAL users discussion list

["Xiaofan Li" <>]

Hi everybody,

 

Just want to know what is the most efficient way to find out all facets (or vertices) within the vicinity (radius) r of a given vertex? I don't want to use global facets/vertex circulators as the mesh is quite large, but want to start from the known vertex where its adjacent halfedges and facets are known. But the question then becomes, how to implement a traverse algorithm to search around the given vertex? Does CGAL provide this functionality or does anyone of you could give me some hints on how to implement this?

 

Thanks a lot in advance.

 

Regards,

Xiaofan

 

------------------------------------------------

Xiaofan Li

 

Biomolecular Modeling Laboratory

Cancer Research UK, London Research Institute

 

Department of Biochemistry and Molecular Biology

University College London

------------------------------------------------