Voronoi polygons
- Subject: [mg3330] Voronoi polygons
- From: jsbrown0 at onyx.Mines.Colorado.EDU (Brown Jeffrey Scott)
- Date: 28 Feb 1996 09:59:35 -0600
- Approved: usenet@wri.com
- Distribution: local
- Newsgroups: wri.mathgroup
- Organization: Colorado School of Mines
- Sender: daemon at wri.com
I'm attempting to get the Voronoi dual of a Delaunay triangulation in a
reasonable amount of time.
I have the ExtendGraphics`Delaunay` package
(from Tom Wickham-Jones "Mathematica Graphics" book);
it uses MathLink and some C code to rapidly generate Delaunay triangulations.
Delaunay::usage states that Delaunay returns {hull, adj, tri}
but it really returns {hull,tri}.
DiscreteMath`ComputationalGeometry has a VoronoiDiagram function,
but this is very slow.
I'd like to be able to use the output of ExtendGraphics`Delaunay` to generate
an ordered adjacency list (either clockwise or counterclockwise) so
I can create polygons of the Voronoi polygons.
Any additional information would be appreciated.
--Jeff Brown
--
Out[_]//TableForm / / / / / / / / / / / / / / / / / / / / / / / / / / / //
// JEFF BROWN Colorado School of Mines //
// December 1993 BSc in Engineering Physics, Mathematics //
// January 1994 -- MS student in Geological Engineering: hydrogeology //
// jsbrown0 at mines.edu //
// jsbrown0 at basalt.mines.edu (NeXT mail) //