CGAL users discussion list

[Sebastien Loriot <>]

I was answering to another thread ;)

Have a nice day!

Sebastien.

On 7/7/22 10:13, KL ( via cgal-discuss Mailing List) 
wrote:
> Your answer led me to the reconstruction tutorial.
>
> I was using the wrong package for my needs.
>
> Thanks for your patience and info,
>
> Cheers
>
> --
>
> 10:08, 7 July 2022, "Sebastien Loriot ( via 
> cgal-discuss Mailing List)" <>:
>
>     how is it different to the other problem you posted and for which I
>     gave you an answer?
>
>     Best,
>
>     Sebastien.
>
>     On 7/7/22 03:03, "Scriven, David" (
>     <> via cgal-discuss
>     Mailing List) wrote:
>
>           I have a problem in which there are 2D planes on which there are
>           thousands of clusters of points (x,y coordinates) - the size
>         of the
>           clusters varies from many tens to many thousands of points and
>         the
>           shapes are variable. For every cluster I have to find the nearest
>           neighbour edge-to-edge distance. My solution so far has been
>         to identify
>           the nearby clusters through their centroids and then do a nearest
>           neighbour search between the  cluster of interest and each
>         cluster that
>           was  identified as nearby. I have to  be able to identify the
>         nearest
>           cluster so I can examine at its properties, so I cannot pool
>         the data.
>
>
>           I can see many ways that this approach could fail - if one
>         doesn't
>           search far enough or if the centroids are very far from the
>         edge of the
>           cluster (imagine two very elongated clusters, one above the
>         other  that
>           have their tips very close but their centroids very far
>         apart).  This
>           sort of scenario becomes more likely when studying the
>         relationship
>           between multi-clusters (clusters of clusters, where the
>         formation is
>           defined by some parameter).
>
>
>           Can someone suggest a rapid, robust and reliable method that
>         could solve
>           this problem?
>
>
>           I was wondering if there was a way to use a Delaunay
>         triangulation on
>           all the points and then, in some way, pick out individual
>         clusters and
>           look at the connections from the edge of that cluster, but
>         it's not
>           obvious to me how to make this work.
>
>
>           David
>
>
>           David Scriven, Ph.D. e-mail :
>         <> <
>         <>>Dept Cellular & Physiological Sci.
>         ph: 604-822-7812 <tel:604-822-7812 <tel:604-822-7812>>
>           2350 Health Sciences Mall, fax: 604-822-2316 <tel:604-822-2316
>         <tel:604-822-2316>>
>           University of British Columbia, Vancouver, BC. V6T 1Z3, Canada
>
>
>           --
>           You are currently subscribed to cgal-discuss.
>           To unsubscribe or access the archives, go to
>         https://sympa.inria.fr/sympa/info/cgal-discuss
>         <https://sympa.inria.fr/sympa/info/cgal-discuss>
>
>
>     -- 
>     You are currently subscribed to cgal-discuss.
>     To unsubscribe or access the archives, go to
>     https://sympa.inria.fr/sympa/info/cgal-discuss
>     <https://sympa.inria.fr/sympa/info/cgal-discuss>
>
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss