Capacity-constrained voronoi tessellation revisited

Abdalla G.M. Ahmed; Oliver Deussen

doi:10.2312/cgvc.20171285

Capacity-constrained voronoi tessellation revisited

Abdalla G.M. Ahmed^*, Oliver Deussen

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English (US)
Title of host publication	Computer Graphics and Visual Computing, CGVC 2017
Editors	Tao Ruan Wan, Franck Vidal
Publisher	Eurographics Association
Pages	97-99
Number of pages	3
ISBN (Electronic)	9783038680505
DOIs	https://doi.org/10.2312/cgvc.20171285
State	Published - 2017
Event	35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017 - Manchester, United Kingdom Duration: Sep 14 2017 → Sep 15 2017

Publication series

Name	Computer Graphics and Visual Computing, CGVC 2017

Conference

Conference	35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017
Country/Territory	United Kingdom
City	Manchester
Period	09/14/17 → 09/15/17

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

Access to Document

10.2312/cgvc.20171285

Cite this

@inproceedings{87d50d76bf1b412caee06bb3ee67f186,

title = "Capacity-constrained voronoi tessellation revisited",

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.",

author = "Ahmed, {Abdalla G.M.} and Oliver Deussen",

note = "Funding Information: This work was partially funded by Deutsche Forschungsgemeinschaft Grant (DE-620/22-1). Publisher Copyright: {\textcopyright} 2017 The Author(s) Eurographics Proceedings {\textcopyright} 2017 The Eurographics Association.; 35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017 ; Conference date: 14-09-2017 Through 15-09-2017",

year = "2017",

doi = "10.2312/cgvc.20171285",

language = "English (US)",

series = "Computer Graphics and Visual Computing, CGVC 2017",

publisher = "Eurographics Association",

pages = "97--99",

editor = "Wan, {Tao Ruan} and Franck Vidal",

booktitle = "Computer Graphics and Visual Computing, CGVC 2017",

}

Ahmed, AGM & Deussen, O 2017, Capacity-constrained voronoi tessellation revisited. in TR Wan & F Vidal (eds), Computer Graphics and Visual Computing, CGVC 2017. Computer Graphics and Visual Computing, CGVC 2017, Eurographics Association, pp. 97-99, 35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017, Manchester, United Kingdom, 09/14/17. https://doi.org/10.2312/cgvc.20171285

Capacity-constrained voronoi tessellation revisited. / Ahmed, Abdalla G.M.; Deussen, Oliver.
Computer Graphics and Visual Computing, CGVC 2017. ed. / Tao Ruan Wan; Franck Vidal. Eurographics Association, 2017. p. 97-99 (Computer Graphics and Visual Computing, CGVC 2017).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Capacity-constrained voronoi tessellation revisited

AU - Ahmed, Abdalla G.M.

AU - Deussen, Oliver

N1 - 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.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85086825737&partnerID=8YFLogxK

U2 - 10.2312/cgvc.20171285

DO - 10.2312/cgvc.20171285

M3 - Conference contribution

AN - SCOPUS:85086825737

T3 - Computer Graphics and Visual Computing, CGVC 2017

SP - 97

EP - 99

BT - Computer Graphics and Visual Computing, CGVC 2017

A2 - Wan, Tao Ruan

A2 - Vidal, Franck

PB - Eurographics Association

T2 - 35th Annual Conference on Computer Graphics and Visual Computing, CGVC 2017

Y2 - 14 September 2017 through 15 September 2017

ER -

Capacity-constrained voronoi tessellation revisited

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this