Subject: CGAL users discussion list
List archive
- From: 杨成林 <>
- To:
- Subject: Re: [cgal-discuss] 2D Point set relaxation
- Date: Thu, 27 Jun 2013 20:44:42 +0800
There is a Periodic_Lloyd_3 demo in CGAL.
2013/6/24 nowayfra <>
Dear all,
I am new to CGAL and I am currently reading the docs to dig out its
possibilities, which seems to be overwhelming, not to say unmanageable for
the average mind ;)
I am hoping to be able using CGAL to do a simple 2D point cloud relaxation
(if possible maintaining the point clusters convex/non-convex hull shape),
using some sort of Lloyds algorithm. The iterations doesnt need to result
into convergence, some few iterations into a coarse approximation would be
sufficient. The main concern is speed, the target point count per point set
would be ~100k at the worst case. So far I haven't found much searching the
CGAL docs and this forum using terms associated to this subject, so i guess
i will need to convert the points into a delaunay triangulation, attach a
voronoi adaptor and read out the voronoi cell edge-vertices positions,
compute all the centers and again create a delaunay triangulation for the
next iteration? Seems to be the naive approach und doesnt sounds like a fast
solution.
Maybe there are some more experienced users here who can point me toward the
right direction?
Thank in advance!
--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/2D-Point-set-relaxation-tp4657697.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss
--
杨成林
Yang Chenglin
- [cgal-discuss] 2D Point set relaxation, nowayfra, 06/24/2013
- Re: [cgal-discuss] 2D Point set relaxation, 杨成林, 06/27/2013
Archive powered by MHonArc 2.6.18.