Related to Voronoi Diagram

[Luis Alma]

Is there any algorithm allowing to do the following?
 
Given a 2-D surface and a certain amount of points on its boundary (not necessarily vertexs), divide the surface into polygons (one for each point in the boundary) containing the nearest points to the boundary point. That`s could be solved using Voronoi Diagram but if there are obstacles to be avoided (the distances are not lines) inside de surface, is there any implementation giving the same results as Voronoi give
 
Thank you, Luis


---------------------------------

    Antivirus • Filtros antispam • 6 MB gratis
    ¿Todavía no tienes un correo inteligente?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040226/224c31a2/attachment.htm