Capacity-constrained voronoi tessellation revisited

Abdalla G.M. Ahmed*, Oliver Deussen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationComputer Graphics and Visual Computing, CGVC 2017
EditorsTao Ruan Wan, Franck Vidal
PublisherEurographics Association
Number of pages3
ISBN (Electronic)9783038680505
StatePublished - 2017
Event35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017 - Manchester, United Kingdom
Duration: Sep 14 2017Sep 15 2017

Publication series

NameComputer Graphics and Visual Computing, CGVC 2017


Conference35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017
Country/TerritoryUnited Kingdom

Bibliographical note

Funding Information:
This work was partially funded by Deutsche Forschungsgemeinschaft Grant (DE-620/22-1).

Publisher Copyright:
© 2017 The Author(s) Eurographics Proceedings © 2017 The Eurographics Association.

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Capacity-constrained voronoi tessellation revisited'. Together they form a unique fingerprint.

Cite this