Voronoi diagram: Difference between revisions

{{task}}

 

 

=={{header|C}}==

[[File:voronoi-C.png|center|300px]]

#include <stdlib.h>

#include <string.h>

gen_map();

return 0;

 

=={{header|C++}}==

[[File:voronoi_cpp.png|256px]]

#include <windows.h>

#include <vector>

#include <string>

 

using namespace std;

 

 

 

 

 

 

 

 

 

 

}

 

 

 

 

 

 

 

 

 

};

 

 

}

}

 

}

 

}

 

}

 

};

 

 

 

 

}

 

=={{header|D}}==

{{trans|Go}}

 

 

 

Image!RGB generateVoronoi(in Point[] pts,

 

// Generate diagram by coloring pixels with color of nearest site.

foreach (immutable x; 0 .. nx)

foreach (immutable y; 0 .. ny) {

((a.x - x) ^^ 2 + (a.y - y) ^^ 2) <

((b.x - x) ^^ 2 + (b.y - y) ^^ 2);

}

 

foreach (immutable p; pts)

return img;

}

.generateVoronoi(imageWidth, imageHeight)

.savePPM6("voronoi.ppm");

 

=={{header|Go}}==

[[file:GoVoronoi.png|thumb|right|Output png]]

 

import (

fmt.Println(err)

}

 

=={{header|Icon}} and {{header|Unicon}}==

[[File:Voronoi-normal_unicon.PNG|right]]

[[File:Voronoi-taxi_unicon.PNG|right]]

 

record site(x,y,colour) # site data position and colour

every site := !siteL do # mark sites

DrawCircle(site.x,site.y,1)

 

{{libheader|Icon Programming Library}}

[http://www.cs.arizona.edu/icon/library/src/procs/graphics.icn graphics.icn provides graphics support]

[http://www.cs.arizona.edu/icon/library/src/procs/strings.icn strings.icn provides cat ]

 

=={{header|J}}==

A straightforward solution: generate random points and for each pixel find the index of the least distance. Note that the square root is avoided to improve performance.

NB. Generates an array of indices of the nearest point

voronoi =: 4 :0

(i.<./)@:(+/@:*:@:-"1&p)"1 ,"0/&i./ y

)

 

 

=={{header|Liberty BASIC}}==

If no place on a vertical line is closer to the current site, then there's no point looking further left or right.

Don't bother square-rooting to get distances..

WindowWidth =600

WindowHeight =600

next y

end function

 

DiagramPlot[{{4.4, 14}, {6.7, 15.25}, {6.9, 12.8}, {2.1, 11.1}, {9.5, 14.9}, {13.2, 11.9}, {10.3, 12.3},

[[File:mma_voronoi.png|Right]]

 

=={{header|Prolog}}==

 

 

voronoi :-

V is random(20) + 20,

minkowski_3(X1, Y1, X2, Y2, D) :-

D is (abs(X2 - X1)**3 + abs(Y2-Y1)**3)**0.33.

[[File:prolog_manhattan.png|320px]]

[[File:prolog_euclide.png‎|320px]]

===Euclidean===

[[File:Voronoi_PureBasic.png‎|320px|thumb|center|Voronoi Diagram in PureBasic]]

x.i: y.i

Colour.i: FillColour.i

If file$ <> ""

SaveImage(img, file$, #PB_ImagePlugin_PNG)

 

===Taxicab===

[[File:Voronoi_Diagram_in_PureBasic_(Taxicab).png‎|320px|thumb|center|Voronoi Diagram in PureBasic]]

x.i: y.i

Colour.i: FillColour.i

If file$ <> ""

SaveImage(img, file$, #PB_ImagePlugin_PNG)

 

=={{header|Python}}==

import random

import math

image.show()

[[File:Voronoi_python.png|500px|thumb|center|Voronoi Diagram in Python]]

 

=={{header|Ruby}}==

Uses [[Raster graphics operations/Ruby]]

[[File:voronoi_rb.png|thumb|right|Sample output from Ruby program]]

 

class ColourPixel < Pixel

 

def distance_to(px, py)

end

 

npoints = 20

 

ColourPixel.new(

)

end

 

pixmap[x, y] = nearest.colour

end

 

pixmap[base.x, base.y] = RGBColour::BLACK

pixmap.draw_circle(base, 2, RGBColour::BLACK)

end

 

 

=={{header|Seed7}}==

[[file:Seed7Voronoi.png|thumb|right]]

include "draw.s7i";

include "keybd.s7i";

KEYBOARD := GRAPH_KEYBOARD;

readln(KEYBOARD);

 

Original source: [http://seed7.sourceforge.net/algorith/graphic.htm#voronoi]

 

=={{header|Tcl}}==

{{libheader|Tk}}

proc r to {expr {int(rand()*$to)}}; # Simple helper

 

# To display while generating, uncomment this line and the other one so commented

#update

 

 

{{omit from|GUISS}}

{{omit from|Lilypond}}

{{omit from|TPP}}