Capacity Constrained Voronoi Tessellation Revisited
Date
2017Metadata
Show full item recordAbstract
Capacity Constrained Voronoi Tessellation is an important concept that greatly influenced recent research on point sampling. The original concept was based on discretizing the sampled domain, and the algorithm was prohibitively slow, even with some proposed accelerations. We present a few improvements that make a real difference in the speed of the algorithm, bringing it back into presence.
BibTeX
@inproceedings {10.2312:cgvc.20171285,
booktitle = {Computer Graphics and Visual Computing (CGVC)},
editor = {Tao Ruan Wan and Franck Vidal},
title = {{Capacity Constrained Voronoi Tessellation Revisited}},
author = {Ahmed, Abdalla G. M. and Deussen, Oliver},
year = {2017},
publisher = {The Eurographics Association},
ISBN = {978-3-03868-050-5},
DOI = {10.2312/cgvc.20171285}
}
booktitle = {Computer Graphics and Visual Computing (CGVC)},
editor = {Tao Ruan Wan and Franck Vidal},
title = {{Capacity Constrained Voronoi Tessellation Revisited}},
author = {Ahmed, Abdalla G. M. and Deussen, Oliver},
year = {2017},
publisher = {The Eurographics Association},
ISBN = {978-3-03868-050-5},
DOI = {10.2312/cgvc.20171285}
}