Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Optimal covering of polyhedron (2D or 3D) with spheres (fixed radius)

Subject: CGAL users discussion list

List archive

[cgal-discuss] Optimal covering of polyhedron (2D or 3D) with spheres (fixed radius)


Chronological Thread 
  • From: <>
  • To:
  • Subject: [cgal-discuss] Optimal covering of polyhedron (2D or 3D) with spheres (fixed radius)
  • Date: Thu, 8 Oct 2009 13:59:51 +0200 (CEST)

Hello,

There are so many algorithms already included in CGAL distribution that I was
wondering if there are algorithms to calculate the optimal distribution of
spheres (with a fixed radius given as input) to cover a polyhedron by
minimizing the number of spheres and the out-bound surface.
Thank you for your help.

Best regards
Sylvain


  • [cgal-discuss] Optimal covering of polyhedron (2D or 3D) with spheres (fixed radius), sylvain.gouttebroze, 10/08/2009

Archive powered by MHonArc 2.6.16.

Top of Page