This data structure dynamically maintains the Voronoi diagram of a set of segments. It provides an exact solution, that is it does not approximate the parabolic arcs of the Voronoi diagram with polylines.
The data structure allows to find the closest segment to a query point.
| Functionality: | dynamic |
| Robustness: | industry strong |
| License: | QPL, commercial |
| Developed by: | INRIA, Notre Dame University |
|
|
|
| User Manual | Reference Manual | Demo |
