CGAL users discussion list

[Bo Schwarzstein <>]

Hello,

Thanks for your replies, you're all very kind people and I will have a try on it.

2010/4/9 Sebastien Loriot (GeometryFactory) <sloriot.ml@gmail.com>

The following post answers your question.

https://lists-sop.inria.fr/sympa/arc/cgal-discuss/2007-06/msg00229.html

S.

Daniel Duque wrote:

Hello,

I am not sure I understand the question, but perhaps it is the same one I
have been considering for a while: a Voronoi diagram inside a rectangle.

I think one would have to check whether the nodes of the Voronoi lattice
(the circumcenters of the Delaunay triangles) lie inside or outside the
rectangle. If the later applies, one has to consider the intersection of
the Voronoi edges with the rectangle in order to build not-so-Voronoi
cells for the vertices of the Delaunay triangle.

Best,

Daniel



Con fecha 8/4/2010, "&#26472;&#25104;&#26519;" <>

escribi�

To make it easier, the points of intersection are not necessary.  Just put
another vertex of the edge outside the rectangle.

2010/4/8 Bo Zhou <>

Laurent Rineau (GeometryFactory) wrote:

You've already been told to post in English only, on that list. Please
respect that guideline.

(I did not understand the question of Bo either.)

Le Mercredi 07 Avril 2010 14:56:41, 杨成林 a écrit :

没看懂你的问题

2010/4/7 Bo Zhou <>

 Hello everyone,

I'm trying to use CGAL's Voronoi Diagrams to subdivide a rectangle
region
which was composed by input sites and the intersection position with
AABB
can be obained, and I can render them as GL_POLYGON directly, just like
the following demo program. But I found it's a little too complicated to
me, so is there any more detailed example ?

Thanks.

Hello,

Thanks for your replies.

My question is, how to use CGAL to generate a voronoi diagram in a bounded
rectangle region, just like this picture
http://upload.wikimedia.org/wikipedia/commons/2/20/Coloured_Voronoi_2D.svg

I found that there is the Unbound_face_iterator by which I can iterate the
all edges, some of them are inner ridges and the others are infinity. How
can I calculate the intersection point between the infinity edges and the
rectangle's 4 segment ?

Thank you again !


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

--
杨成林

Yang Chenglin

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

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