Name
Abstract | ||
|---|---|---|
We design and implement an efficient algorithm for the computation of generalized Voronoï Diagrams (VD's) constrained to a given domain. Our framework is general and applicable to any VD-type where the distance field is given by a polynomial. We use the Bernstein form of polynomials to subdivide the domain and isolate bisector domains or domains that contain a Voronoï vertex. Efficiency is due to a filtering process, based on bounding the distance functions over the subdivided domains. The output is a polygonal description of each Voronoï cell up to any user-defined precision. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1145/2245276.2245299 | SAC |
Keywords | Field | DocType |
bernstein form,polygonal description,distance function,generalized vorono,bisector domain,efficient algorithm,distance field,user-defined precision,subdivided domain,voronoi diagram | Power diagram,Centroidal Voronoi tessellation,Bowyer–Watson algorithm,Polynomial,Computer science,Algorithm,Distance transform,Fortune's algorithm,Weighted Voronoi diagram,Voronoi diagram | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ioannis Emiris | 1 | 40 | 6.39 |
| Angelos Mantzaflaris | 2 | 82 | 11.47 |
| Bernard Mourrain | 3 | 1074 | 113.70 |