Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Get near vertices

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Get near vertices


Chronological Thread 
  • From: Laurent Rineau <>
  • To:
  • Subject: Re: [cgal-discuss] Get near vertices
  • Date: Wed, 25 Jul 2007 17:36:28 +0200
  • Organization: Inria, Sophia Antipolis, FRANCE

On Wednesday 25 July 2007 17:26:37 Tyver Ray wrote:
> Hello !
>
> I would like to know if it's possible to select all the points of a 2D
> delaunay triangulation which are in a ray r from a reference point?

You should read the CGAL manual about CGAL::Point_set_2, in the package
named "2D Range and Neighbor Search". That template class derives from a 2D
Delaunay triangulation, and provides a function range_search() that seems to
be exactly what you asked:

template<class OutputIterator>
OutputIterator PS.range_search ( Circle C, OutputIterator res);

"computes handles to all vertices contained in the closure of disk C. The
computed vertex handles will be placed as a sequence of objects in a
container of value type of res which points to the first object in the
sequence. The function returns an output iterator pointing to the position
beyond the end of the sequence."

(Quoted from
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Point_set_2_ref/Class_Point_set_2.html)


--
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Tel: +33 4 92 38 78 62



Archive powered by MHonArc 2.6.16.

Top of Page