Show simple item record

dc.contributor.authorAhmed, Abdalla G. M.en_US
dc.contributor.authorDeussen, Oliveren_US
dc.contributor.editorTao Ruan Wan and Franck Vidalen_US
dc.date.accessioned2017-09-21T07:22:58Z
dc.date.available2017-09-21T07:22:58Z
dc.date.issued2017
dc.identifier.isbn978-3-03868-050-5
dc.identifier.urihttp://dx.doi.org/10.2312/cgvc.20171285
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/cgvc20171285
dc.description.abstractCapacity 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.publisherThe Eurographics Associationen_US
dc.titleCapacity Constrained Voronoi Tessellation Revisiteden_US
dc.description.seriesinformationComputer Graphics and Visual Computing (CGVC)
dc.description.sectionheadersComputer Graphics Applications
dc.identifier.doi10.2312/cgvc.20171285
dc.identifier.pages97-99


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record