Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Using finger search with Delaunay Triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Using finger search with Delaunay Triangulation


Chronological Thread 
  • From: "Laurent Rineau (GeometryFactory)" <>
  • To:
  • Cc: Sylvain Pion <>
  • Subject: Re: [cgal-discuss] Using finger search with Delaunay Triangulation
  • Date: Wed, 22 Apr 2009 13:54:46 +0200
  • Organization: GeometryFactory

On Wednesday 22 April 2009 13:48:01 Sylvain Pion wrote:
> Laurent Rineau (GeometryFactory) wrote:
> > On Wednesday 22 April 2009 13:29:31 Manuel Caroli wrote:
> >> Hi Manuel,
> >>
> >> you are right. Unlike point location the nearest vertex query is not
> >> overloaded by the triangulation hierarchy. Followingly the one from DT
> >> is called.
> >
> > That is a bug, in my opinion. Would it be easy to overload the nearest
> > vertex query?
>
> I'm working on it.

In my opinion we should use the *template pattern* (from the book of
Gamma&al.), maybe using a CRTP, so that all methods of the triangulation that
depend on the "locate" function are accelerated in the hierarchy.

--
Laurent Rineau, PhD
Engineer at GeometryFactory
http://www.geometryfactory.com/




Archive powered by MHonArc 2.6.16.

Top of Page