GPU-based efficient computation of power diagram
[Display omitted] •We introduced the GPU-based JFA for parallelly rendering the power diagram.•We proposed a method to extract the geometrical of the power diagram.•Our constructing method is coupled with the existing method as a hybrid algorithm.•We put the JFA and GPU-based optimization into our p...
Gespeichert in:
Veröffentlicht in: | Computers & graphics 2019-05, Vol.80, p.29-36 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 36 |
---|---|
container_issue | |
container_start_page | 29 |
container_title | Computers & graphics |
container_volume | 80 |
creator | Zheng, Liping Gui, Zhiqiang Cai, Ruiwen Fei, Yue Zhang, Gaofeng Xu, Benzhu |
description | [Display omitted]
•We introduced the GPU-based JFA for parallelly rendering the power diagram.•We proposed a method to extract the geometrical of the power diagram.•Our constructing method is coupled with the existing method as a hybrid algorithm.•We put the JFA and GPU-based optimization into our pure GPU algorithm.
Power diagrams are widely used in graphics and engineering. One of the most complex operations defined on the centroidal capacity-constrained power diagrams is the geometrical construction, which takes more than 50% of the total computing time. In order to overcome this performance bottleneck, we propose a novel GPU-based power diagram construction algorithm. To this end, we first introduce the jump flooding algorithm for parallel rendering of the power diagram, and present an approach for extracting the geometrical vertices and edges. Next, we introduce two novel GPU-based algorithms to improve the computational performance. The first algorithm allows a hybrid GPU-CPU implementation by coupling the existing CPU-based algorithm while the second algorithm is a pure GPU implementation for the platforms where GPU hardware is capable of significant speedups. In our implementation, we utilize the discrete Lloyd’s algorithm for centroidal constraints and a GPU-based analytical algorithm for weights and capacities. Experiment results show that our approach improves the effciency of the power diagram construction up to several orders of magnitude. |
doi_str_mv | 10.1016/j.cag.2019.03.011 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2246258246</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0097849319300342</els_id><sourcerecordid>2246258246</sourcerecordid><originalsourceid>FETCH-LOGICAL-c325t-efb061d8eaffc5be80f21448497aadc59c84f03cb84c9a2d46657ded789c20ee3</originalsourceid><addsrcrecordid>eNp9kDFPwzAQhS0EEqXwA9giMSecHcdxxIQqaJEqwUBny7HPlSNaBzsF8e9xVWaWu-W9u_c-Qm4pVBSouB8qo7cVA9pVUFdA6RmZUdnWZSskPyczgK4tJe_qS3KV0gAAjAk-I7B825S9TmgLdM4bj_upMGE3HiY9-bAvgivG8I2xsF5vo95dkwunPxLe_O052Tw_vS9W5fp1-bJ4XJemZs1UoutBUCtRO2eaHiU4RjnPCVqtrWk6I7mD2vSSm04zy4VoWou2lZ1hgFjPyd3p7hjD5wHTpIZwiPv8UjHGBWtknllFTyoTQ0oRnRqj3-n4oyioIxg1qAxGHcEoqFUGkz0PJw_m-F8eo0rH2gatj2gmZYP_x_0LB2BqfA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2246258246</pqid></control><display><type>article</type><title>GPU-based efficient computation of power diagram</title><source>Elsevier ScienceDirect Journals</source><creator>Zheng, Liping ; Gui, Zhiqiang ; Cai, Ruiwen ; Fei, Yue ; Zhang, Gaofeng ; Xu, Benzhu</creator><creatorcontrib>Zheng, Liping ; Gui, Zhiqiang ; Cai, Ruiwen ; Fei, Yue ; Zhang, Gaofeng ; Xu, Benzhu</creatorcontrib><description>[Display omitted]
•We introduced the GPU-based JFA for parallelly rendering the power diagram.•We proposed a method to extract the geometrical of the power diagram.•Our constructing method is coupled with the existing method as a hybrid algorithm.•We put the JFA and GPU-based optimization into our pure GPU algorithm.
Power diagrams are widely used in graphics and engineering. One of the most complex operations defined on the centroidal capacity-constrained power diagrams is the geometrical construction, which takes more than 50% of the total computing time. In order to overcome this performance bottleneck, we propose a novel GPU-based power diagram construction algorithm. To this end, we first introduce the jump flooding algorithm for parallel rendering of the power diagram, and present an approach for extracting the geometrical vertices and edges. Next, we introduce two novel GPU-based algorithms to improve the computational performance. The first algorithm allows a hybrid GPU-CPU implementation by coupling the existing CPU-based algorithm while the second algorithm is a pure GPU implementation for the platforms where GPU hardware is capable of significant speedups. In our implementation, we utilize the discrete Lloyd’s algorithm for centroidal constraints and a GPU-based analytical algorithm for weights and capacities. Experiment results show that our approach improves the effciency of the power diagram construction up to several orders of magnitude.</description><identifier>ISSN: 0097-8493</identifier><identifier>EISSN: 1873-7684</identifier><identifier>DOI: 10.1016/j.cag.2019.03.011</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Algorithms ; Apexes ; Capacity ; Centroidal ; Computational efficiency ; Computing time ; Constraints ; Flooding ; GPU accelerate ; Graph theory ; Graphics processing units ; Power diagram</subject><ispartof>Computers & graphics, 2019-05, Vol.80, p.29-36</ispartof><rights>2019 Elsevier Ltd</rights><rights>Copyright Elsevier Science Ltd. May 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c325t-efb061d8eaffc5be80f21448497aadc59c84f03cb84c9a2d46657ded789c20ee3</citedby><cites>FETCH-LOGICAL-c325t-efb061d8eaffc5be80f21448497aadc59c84f03cb84c9a2d46657ded789c20ee3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0097849319300342$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Zheng, Liping</creatorcontrib><creatorcontrib>Gui, Zhiqiang</creatorcontrib><creatorcontrib>Cai, Ruiwen</creatorcontrib><creatorcontrib>Fei, Yue</creatorcontrib><creatorcontrib>Zhang, Gaofeng</creatorcontrib><creatorcontrib>Xu, Benzhu</creatorcontrib><title>GPU-based efficient computation of power diagram</title><title>Computers & graphics</title><description>[Display omitted]
•We introduced the GPU-based JFA for parallelly rendering the power diagram.•We proposed a method to extract the geometrical of the power diagram.•Our constructing method is coupled with the existing method as a hybrid algorithm.•We put the JFA and GPU-based optimization into our pure GPU algorithm.
Power diagrams are widely used in graphics and engineering. One of the most complex operations defined on the centroidal capacity-constrained power diagrams is the geometrical construction, which takes more than 50% of the total computing time. In order to overcome this performance bottleneck, we propose a novel GPU-based power diagram construction algorithm. To this end, we first introduce the jump flooding algorithm for parallel rendering of the power diagram, and present an approach for extracting the geometrical vertices and edges. Next, we introduce two novel GPU-based algorithms to improve the computational performance. The first algorithm allows a hybrid GPU-CPU implementation by coupling the existing CPU-based algorithm while the second algorithm is a pure GPU implementation for the platforms where GPU hardware is capable of significant speedups. In our implementation, we utilize the discrete Lloyd’s algorithm for centroidal constraints and a GPU-based analytical algorithm for weights and capacities. Experiment results show that our approach improves the effciency of the power diagram construction up to several orders of magnitude.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Capacity</subject><subject>Centroidal</subject><subject>Computational efficiency</subject><subject>Computing time</subject><subject>Constraints</subject><subject>Flooding</subject><subject>GPU accelerate</subject><subject>Graph theory</subject><subject>Graphics processing units</subject><subject>Power diagram</subject><issn>0097-8493</issn><issn>1873-7684</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kDFPwzAQhS0EEqXwA9giMSecHcdxxIQqaJEqwUBny7HPlSNaBzsF8e9xVWaWu-W9u_c-Qm4pVBSouB8qo7cVA9pVUFdA6RmZUdnWZSskPyczgK4tJe_qS3KV0gAAjAk-I7B825S9TmgLdM4bj_upMGE3HiY9-bAvgivG8I2xsF5vo95dkwunPxLe_O052Tw_vS9W5fp1-bJ4XJemZs1UoutBUCtRO2eaHiU4RjnPCVqtrWk6I7mD2vSSm04zy4VoWou2lZ1hgFjPyd3p7hjD5wHTpIZwiPv8UjHGBWtknllFTyoTQ0oRnRqj3-n4oyioIxg1qAxGHcEoqFUGkz0PJw_m-F8eo0rH2gatj2gmZYP_x_0LB2BqfA</recordid><startdate>201905</startdate><enddate>201905</enddate><creator>Zheng, Liping</creator><creator>Gui, Zhiqiang</creator><creator>Cai, Ruiwen</creator><creator>Fei, Yue</creator><creator>Zhang, Gaofeng</creator><creator>Xu, Benzhu</creator><general>Elsevier Ltd</general><general>Elsevier Science Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201905</creationdate><title>GPU-based efficient computation of power diagram</title><author>Zheng, Liping ; Gui, Zhiqiang ; Cai, Ruiwen ; Fei, Yue ; Zhang, Gaofeng ; Xu, Benzhu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c325t-efb061d8eaffc5be80f21448497aadc59c84f03cb84c9a2d46657ded789c20ee3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Capacity</topic><topic>Centroidal</topic><topic>Computational efficiency</topic><topic>Computing time</topic><topic>Constraints</topic><topic>Flooding</topic><topic>GPU accelerate</topic><topic>Graph theory</topic><topic>Graphics processing units</topic><topic>Power diagram</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zheng, Liping</creatorcontrib><creatorcontrib>Gui, Zhiqiang</creatorcontrib><creatorcontrib>Cai, Ruiwen</creatorcontrib><creatorcontrib>Fei, Yue</creatorcontrib><creatorcontrib>Zhang, Gaofeng</creatorcontrib><creatorcontrib>Xu, Benzhu</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computers & graphics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zheng, Liping</au><au>Gui, Zhiqiang</au><au>Cai, Ruiwen</au><au>Fei, Yue</au><au>Zhang, Gaofeng</au><au>Xu, Benzhu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>GPU-based efficient computation of power diagram</atitle><jtitle>Computers & graphics</jtitle><date>2019-05</date><risdate>2019</risdate><volume>80</volume><spage>29</spage><epage>36</epage><pages>29-36</pages><issn>0097-8493</issn><eissn>1873-7684</eissn><abstract>[Display omitted]
•We introduced the GPU-based JFA for parallelly rendering the power diagram.•We proposed a method to extract the geometrical of the power diagram.•Our constructing method is coupled with the existing method as a hybrid algorithm.•We put the JFA and GPU-based optimization into our pure GPU algorithm.
Power diagrams are widely used in graphics and engineering. One of the most complex operations defined on the centroidal capacity-constrained power diagrams is the geometrical construction, which takes more than 50% of the total computing time. In order to overcome this performance bottleneck, we propose a novel GPU-based power diagram construction algorithm. To this end, we first introduce the jump flooding algorithm for parallel rendering of the power diagram, and present an approach for extracting the geometrical vertices and edges. Next, we introduce two novel GPU-based algorithms to improve the computational performance. The first algorithm allows a hybrid GPU-CPU implementation by coupling the existing CPU-based algorithm while the second algorithm is a pure GPU implementation for the platforms where GPU hardware is capable of significant speedups. In our implementation, we utilize the discrete Lloyd’s algorithm for centroidal constraints and a GPU-based analytical algorithm for weights and capacities. Experiment results show that our approach improves the effciency of the power diagram construction up to several orders of magnitude.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cag.2019.03.011</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0097-8493 |
ispartof | Computers & graphics, 2019-05, Vol.80, p.29-36 |
issn | 0097-8493 1873-7684 |
language | eng |
recordid | cdi_proquest_journals_2246258246 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Apexes Capacity Centroidal Computational efficiency Computing time Constraints Flooding GPU accelerate Graph theory Graphics processing units Power diagram |
title | GPU-based efficient computation of power diagram |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T08%3A17%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=GPU-based%20efficient%20computation%20of%20power%20diagram&rft.jtitle=Computers%20&%20graphics&rft.au=Zheng,%20Liping&rft.date=2019-05&rft.volume=80&rft.spage=29&rft.epage=36&rft.pages=29-36&rft.issn=0097-8493&rft.eissn=1873-7684&rft_id=info:doi/10.1016/j.cag.2019.03.011&rft_dat=%3Cproquest_cross%3E2246258246%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2246258246&rft_id=info:pmid/&rft_els_id=S0097849319300342&rfr_iscdi=true |