Just to make this a bit more clear -- I want to traverse within a give radius R which can include more than 1 layer of the facets. So local circulator such as halfedge_around_facet_circulator won't work straightaway either.

________________________________

From: Xiaofan Li [mailto:

[hidden email]]

Sent: Thu 7/31/2008 03:17

To:

[hidden email]
Subject: [cgal-discuss] Traversing the vicinity faces of a given vertex on a polyhedron

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

[hidden email] <mailto:

[hidden email]>

Department of Biochemistry and Molecular Biology

University College London

[hidden email] <mailto:

[hidden email]>

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

--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://lists-sop.inria.fr/wws/info/cgal-discuss