Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Data structures for 3 dimensional arrangements

Subject: CGAL users discussion list

List archive

[cgal-discuss] Data structures for 3 dimensional arrangements


Chronological Thread 
  • From: Christoph Weber <>
  • To: cgal-liste <>
  • Subject: [cgal-discuss] Data structures for 3 dimensional arrangements
  • Date: Mon, 13 Jul 2009 16:25:05 +0200

Hi all,


I am looking for a data structure for 3 dim substructures. It should be
able to represent the 3 dimensional space tesselated by irregular
polyhedrons. I need it for storing 3 dimensional Voronoi-Diagrams, so
that I can distuingish different voronoi cells, access neibors, etc. I
found a paper of D. Dobkin and J. Laszlo:

"Primitives for the Manipulations of Three Dimensional Subdivisions".

The data strucuture presented there seems to be similar to the double
connected edge list, let's say, a double connected facet-edge pair. Is
something like that already implemented in CGAL ?
(I suppose not, because I didn't find anythig in the manual, but for
beeing sure I wrote this mail )

regards, Christoph




Archive powered by MHonArc 2.6.16.

Top of Page