# VoronoiDelaunay.jl difficulties

**URL:** https://discourse.julialang.org/t/voronoidelaunay-jl-difficulties/5206
**Category:** General Usage
**Tags:** package
**Created:** [August 3, 2017, 4:19pm UTC](https://discourse.julialang.org/t/voronoidelaunay-jl-difficulties/5206 "2017-08-03T16:19:22Z")
**Posts on this page:** 3
**Page:** 1

<div class="post-metadata">

### Author: ![healyp](https://avatars.discourse-cdn.com/v4/letter/h/67e7ee/32.png) [@healyp](https://discourse.julialang.org/u/healyp)
#### Post date: [August 3, 2017, 4:19pm UTC](https://discourse.julialang.org/t/voronoidelaunay-jl-difficulties/5206/1 "2017-08-03T16:19:22Z")

</div>

[Sorry, this is probably not the most appropriate group for this question.]

I’m having difficulty reproducing the intoductory example of the VoronoiDelaunay documentation.

```julia
using VoronoiDelaunay
tess = DelaunayTessellation()
push!(tess, Point(1.5, 1.5))

```

works fine, but

```julia
width = max_coord - min_coord
a= Point2D[Point(min_coord+rand()*width, min_coord+rand()*width) for i in 1:10]
push!(tess, a)

```

sends the CPU into a tailspin. (Edit: note that I’m only adding 10 points.)

```julia
julia> Pkg.installed("VoronoiDelaunay")
v"0.2.0"

```

```julia
julia> versioninfo()
Julia Version 0.6.0
Commit 9036443 (2017-06-19 13:05 UTC)
   :

```

Could anybody help / explain?

Also, the package seems to be 64 bit-specific 🙂 Earlier I tried installing on a 32 bit-machine and IIRC the function quadrants() failed.

---

<div class="post-metadata">

### Author: ![sambitdash](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/sambitdash/32/1377_2.png) [@sambitdash](https://discourse.julialang.org/u/sambitdash)
#### Post date: [August 3, 2017, 6:25pm UTC](https://discourse.julialang.org/t/voronoidelaunay-jl-difficulties/5206/2 "2017-08-03T18:25:25Z")

</div>

Without looking at the code it may be hard to comment but just one point cannot be really producing any tesselation. However, here are some simple test cases that may work.

2 points will give you a bisecting line - So no triagulations  
3 points the side bisectors of the triangle meeting at a point called circumcenter - 1 triangle at the circumcenter.  
4 points in a rectangle would split the region into 2-D axis like coordinate axis. - 2 triangles at one diagonal.

Once you can be a bit certain then you may try 10 point case. Will suggest to provide well defined numbers first before trying random numbers.

regards,

Sambit

---

<div class="post-metadata">

### Author: ![stevengj](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/stevengj/32/71_2.png) [@stevengj](https://discourse.julialang.org/u/stevengj)
#### Post date: [August 3, 2017, 7:44pm UTC](https://discourse.julialang.org/t/voronoidelaunay-jl-difficulties/5206/3 "2017-08-03T19:44:39Z")

</div>

> [@healyp](#):
>
> Sorry, this is probably not the most appropriate group for this question

Normally, for a package-specific problem like this, you would file an issue on the package’s github page: [Issues · JuliaGeometry/VoronoiDelaunay.jl · GitHub](https://github.com/JuliaGeometry/VoronoiDelaunay.jl/issues)
