Is it possible to color the scipy.spatial.Voronoi diagram? I know it is. But now my goal is to color each cell according to a color scale to represent a physical quantity. As in the image below ...

I am computing a voronoi diagram from a set of points as follows: from scipy.spatial import Voronoi import numpy as np np.random.seed(0) points = np.random.uniform(-0.5, 0.5, (100, 2)) # Compute...

I have a binary image of a worm (blob extraction which works well). I am interested in fitting a centerline on the blob (worm). So far I came up with this: starting from a polygon (after outline ex...

Background I'm trying to visualize the results of a kmeans clustering procedure on the following data using voronoi polygons on a US map. Here is the code I've been running so far: input <- read...

I have data in the form (x, y, z) where x and y are not on a regular grid. I wish to display a 2D colormap of these data, with intensity (say, grey scale) mapped to the z variable. An obvious solut...

Given N points in a map of edges Map<Point, List<Edge>>, it's possible to get the polygons formed by these edges in O(N log N)? What I know is that you have to walk all the vertices an...

I am trying to compute a Voronoi tesselation in 2D with the Manhattan distance in R. Ideally this would be a function that takes a set of two-dimensional points and outputs a list of polygons tha...

Node Assignment Problem The problem I want to solve is to tessellate the map given with the Blue Nodes(Source Nodes) as given input points, Once I am able to do this I would like to see how many...

I'm implementing Voronoi tesselation followed by smoothing. For the smoothing I was going to do Lloyd relaxation, but I've encountered a problem. I'm using following module for calculation of Vor...

I want to calculate Thiessen weights to compute areal rainfall from number of point measurements. I am using R and thanks to some previous question in the same topic, I got to know that I can use ...

I am implementing Fortune's sweepline algorithm for computing Voronoi diagrams. My primary reference is "Computational Geometry: Algorithms and Applications" by de Berg et al., and while their cove...

I'm looking for a simple (if exists) algorithm to find the Voronoi diagram for a set of points on the surface of a sphere. Source code would be great. I'm a Delphi man (yes, I know...), but I eat C...

I am trying to create Voronoi polygons (aka Dirichlet tessellations or Thiessen polygons) within a fixed geographic region for a set of points. However, I am having trouble finding a method in R th...

I have spent a great deal of time now trying to obtain edges from the scipy.spatial.Voronoi diagram to no avail. Here is the main documentation: http://docs.scipy.org/doc/scipy-dev/reference/genera...

I need to find "near" neighbors among a set of points. There are 10 points in the above image. Red lines are edges from the Delaunay Triangulation, black stars mark the mid-lines of the edges, b...

I have about 50,000 data points in 3D on which I have run scipy.spatial.Delaunay from the new scipy (I'm using 0.10) which gives me a very useful triangulation. Based on: http://en.wikipedia.org/w...

Using the voronoi/delaunay diagram generation library found in this program, which is based on Fortune's original implementation of his algorithm, with a random set of points as input data, I am ab...

I am working with an algorithm that, for each iteration, needs to find which region of a Voronoi diagram a set of arbirary coordinats belong to. that is, which region each coordinate is located wit...

I am implementing Voronoi diagram to find out the nearest location in a map visually. Right now I want to do this using integer coordinates (x,y) only in a canvas. Problem is- I am really confused...

I am trying to get the points which form a polygon to fill it with some color. I have a set of points and then I calculate the Voronoi Diagram for it. The result is this: Green points are the po...

Recently I am trying to use the library boost to compute Voronoi diagram. The algorithm in this library is based on sweep-line. But it is not based on a bounding box to generate diagram. Some of Vo...

This is really more of a math question. But given 3 points how do you calculate the farthest point voronoi diagram? Start by finding circle that passes through all of them and grabbing its center...

Is there a code/library that can calculate a Voronoi diagram for planes (parallelograms) in 3D? I checked Qhull and it seems it can only work with points, in its examples Voro++ works with differen...

I need to generate a Voronoi diagram around a concave (non-convex) inside polygon. I have looked for methods online, but I haven't been able to figure out how to do this. Basically, I generate the ...

I got a big prob with mathematica(using version 8). Plotting a Voronoi Diagram is simple stuff, but how about changing the norm? << DiscreteMath`ComputationalGeometry` data2D = {{4.4, 14}, {...