Re: voronoi polygons

Hi Ricardo,

VisAD does not contain any code to construct Voronoi polygons, but the
Delaunay logic includes everything you need to easily create them
yourself. Each Voronoi polygon is computed by finding the center point
of each triangle/tetrahedron (average of Tri vertex samples), and
connecting those center points across the triangle edges/faces (using
the Walk array).

Alternately, you could feed the results of a triangulation in VisAD to
some external software capable of computing Voronoi diagrams from an
input triangulation.

-Curtis

On 1/31/07, Ricardo Mantilla <ricardo@xxxxxxxxxxxxxxxxxx> wrote:
Hi,

Has anyone developed methods to obtain the Voronoi polygons from a
Delaunay triangulation?

I think this question was asked some time ago and at the time there was
no such class implemented.

Thanks,
   Ricardo

--
-------------------------------------------------------------
Ricardo Mantilla
Posdoctoral Research Associate

Department of Earth and Environmental Science
New Mexico Institute of Mining and Technology
801 Leroy Pl. MSEC 254
Socorro, NM 87801

Phone: (505) 835-5068
Office: MSEC 254
http://cires.colorado.edu/~ricardo/
-------------------------------------------------------------

==============================================================================
To unsubscribe visad, visit:
http://www.unidata.ucar.edu/mailing-list-delete-form.html
==============================================================================



==============================================================================
To unsubscribe visad, visit:
http://www.unidata.ucar.edu/mailing-list-delete-form.html
==============================================================================


  • 2007 messages navigation, sorted by:
    1. Thread
    2. Subject
    3. Author
    4. Date
    5. ↑ Table Of Contents
  • Search the visad archives: