computational geometry - Identifying the Voronoi Verticies -


i have list of 2 dimensional points , have been able find voronoi diagram using fortune algorithm implementation here, have been able compute dual delaunnay triangulation same set of points..

in figure can see input points in black, , voronoi cells in red. enter image description here

the vornoi diagram represented list of vertices, , list of edges..

i need find list of vertices form voronoi cell of given input point ?

for example, given point near end of brown arrow in figure above,, need identify voronoi vertices marked blue circles..

i know voronoi vertices forming cell enclosing point can identified checking vornoi vertices have equal distance between point , other points... bu there more efficient solution ?

is there way identify vertices voronoi diagram or delaunay triangulation ?

or there implementation of voronoi diagram can give me vertices given input point ?


Comments

Popular posts from this blog

SPSS keyboard combination alters encoding -

Add new record to the table by click on the button in Microsoft Access -

CSS3 Transition to highlight new elements created in JQuery -