Capacity Constrained Voronoi Tessellation Revisited

Eurographics DL Repository

Show simple item record

dc.contributor.author Ahmed, Abdalla G. M. en_US
dc.contributor.author Deussen, Oliver en_US
dc.contributor.editor Tao Ruan Wan and Franck Vidal en_US
dc.date.accessioned 2017-09-21T07:22:58Z
dc.date.available 2017-09-21T07:22:58Z
dc.date.issued 2017
dc.identifier.isbn 978-3-03868-050-5
dc.identifier.uri http://dx.doi.org/10.2312/cgvc.20171285
dc.identifier.uri https://diglib.eg.org:443/handle/10.2312/cgvc20171285
dc.description.abstract 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. en_US
dc.publisher The Eurographics Association en_US
dc.title Capacity Constrained Voronoi Tessellation Revisited en_US
dc.description.seriesinformation Computer Graphics and Visual Computing (CGVC)
dc.description.sectionheaders Computer Graphics Applications
dc.identifier.doi 10.2312/cgvc.20171285
dc.identifier.pages 97-99


Files in this item

Pay-Per-View via TIB Hannover:

Try if this item/paper is available.

This item appears in the following Collection(s)

Show simple item record

Search Eurographics DL


Browse

My Account