CGAL users discussion list

[Navneet Kapur <>]

Hey.
Thanks for taking interest.
As the usual Voronoi Tessellation is defined, a 2D space is divided into n regions according to n-sites. Now, suppose instead of the underlying 2D space, you have a list of 2D points that you need to distribute among the n sites. So, the final result would be pretty familiar, i.e., for example, if a point i occurs in the continuous Voronoi region of site k, then here, in the discrete case, it would alloted to site k. Basically, each point needs to be to its closest site.

So, I just wanted to know whether such an implementation would be there in CGAL.

Thank you. 
Hope you can help.

On Sat, Aug 29, 2009 at 8:54 AM, Zohar Levi <> wrote:

What do you mean exactly, and how it differs from the standard voronoi?

---

From: "" <>
To:
Sent: Friday, August 28, 2009 2:54:26 PM
Subject: [cgal-discuss] Discrete Voronoi Implementation

Hi.
I need to create a Voronoi Tessellation with a discrete space of points  with
n-sites. Is it implemented in CGAL? And could anyone suggest me how I could do
it?

Thank you.

Navneet.
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss

-- 
I'm NOT almost gr8.