Fast and Memory‐Efficient Voronoi Diagram Construction on Triangle Meshes
Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodes...
Saved in:
| Published in | Computer graphics forum Vol. 36; no. 5; pp. 93 - 104 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Oxford
Blackwell Publishing Ltd
01.08.2017
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodesic based Voronoi diagrams. In this paper, we propose the window‐VTP algorithm, which can effectively reduce redundant computation and save memory. As a result, constructing Voronoi diagrams using the proposed window‐VTP algorithm runs 3–8 times faster than Liu et al.'s method [LCT11], 1.2 times faster than its FWP‐MMP variant and more importantly uses 10–70 times less memory than both of them. |
|---|---|
| AbstractList | Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodesic based Voronoi diagrams. In this paper, we propose the window‐VTP algorithm, which can effectively reduce redundant computation and save memory. As a result, constructing Voronoi diagrams using the proposed window‐VTP algorithm runs 3–8 times faster than Liu et al.'s method [LCT11], 1.2 times faster than its FWP‐MMP variant and more importantly uses 10–70 times less memory than both of them. Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which has become the bottleneck of constructing geodesic based Voronoi diagrams. In this paper, we propose the window‐VTP algorithm, which can effectively reduce redundant computation and save memory. As a result, constructing Voronoi diagrams using the proposed window‐VTP algorithm runs 3–8 times faster than Liu et al.'s method [ LCT11 ], 1.2 times faster than its FWP‐MMP variant and more importantly uses 10–70 times less memory than both of them. |
| Author | Yu, Hongchuan Qin, Yipeng Zhang, Jianjun |
| Author_xml | – sequence: 1 givenname: Yipeng surname: Qin fullname: Qin, Yipeng organization: Bournemouth University – sequence: 2 givenname: Hongchuan surname: Yu fullname: Yu, Hongchuan organization: Bournemouth University – sequence: 3 givenname: Jianjun surname: Zhang fullname: Zhang, Jianjun organization: Bournemouth University |
| BookMark | eNp1kM9OAjEQxhuDiYAefINNPHlYaHe32-3RrIBGjBf02gylxZKlxXaJ4eYj-Iw-iUU4GZ1MMnP4ffPn66GOdVYhdEnwgMQYyqUekDwrqhPUJUXJ0qqkvIO6mMSeYUrPUC-EFca4YCXtoocxhDYBu0ge1dr53dfH50hrI42ybfLivLPOJLcGlh7WSe1saP1WtsbZJObMG7DLRkVteFXhHJ1qaIK6ONY-eh6PZvVdOn2a3Nc301RmnFUp5YXWi7ysgHOJueSKllQrRQAwoQoozee6lBWlks6pLggrFll8A-Y4UxLKvI-uDnM33r1tVWjFym29jSsF4VmVsyJnVaSGB0p6F4JXWkjTwv701oNpBMFi75iIjokfx6Li-pdi480a_O5P9jj93TRq9z8o6sn4oPgGyOt9Ug |
| CitedBy_id | crossref_primary_10_1109_TVCG_2019_2904271 crossref_primary_10_1080_15481603_2023_2171703 crossref_primary_10_1007_s41095_022_0326_0 crossref_primary_10_1145_3550454_3555453 crossref_primary_10_1016_j_gmod_2023_101196 crossref_primary_10_1016_j_jocs_2021_101301 crossref_primary_10_1145_3272127_3275072 |
| Cites_doi | 10.1109/TVCG.2015.2407404 10.1016/j.cad.2014.08.021 10.1109/TPAMI.2007.54 10.1007/s11263-006-6859-3 10.1145/2897824.2925930 10.1109/TPAMI.2008.21 10.1145/1559755.1559761 10.1145/2461912.2461946 10.1145/2516971.2516977 10.1111/cgf.12484 10.1145/1073204.1073228 10.1145/116873.116880 10.1073/pnas.95.15.8431 10.1109/TPAMI.2010.221 10.1016/S0925-7721(02)00077-9 10.1137/0216045 |
| ContentType | Journal Article |
| Copyright | 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2017 The Eurographics Association and John Wiley & Sons Ltd. |
| Copyright_xml | – notice: 2017 The Author(s) Computer Graphics Forum © 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2017 The Eurographics Association and John Wiley & Sons Ltd. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1111/cgf.13248 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1467-8659 |
| EndPage | 104 |
| ExternalDocumentID | 10_1111_cgf_13248 CGF13248 |
| Genre | article |
| GroupedDBID | .3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCFJ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN ADZOD AEEZP AEGXH AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFNX AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AHEFC AHQJS AITYG AIURR AIWBW AJBDE AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAYXX ADMLS AEYWJ AGHNM AGQPQ AGYGG CITATION 7SC 8FD AAMMB AEFGJ AGXDD AIDQK AIDYY JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c2978-594ffd368a99c09c9e565fee1aa015ea553bf6c855c5b5f4174d2865ab02eca63 |
| IEDL.DBID | DR2 |
| ISSN | 0167-7055 |
| IngestDate | Sun Jul 13 03:17:59 EDT 2025 Tue Jul 01 02:23:08 EDT 2025 Thu Apr 24 23:01:24 EDT 2025 Wed Jan 22 16:47:18 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2978-594ffd368a99c09c9e565fee1aa015ea553bf6c855c5b5f4174d2865ab02eca63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1928374378 |
| PQPubID | 30877 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_1928374378 crossref_citationtrail_10_1111_cgf_13248 crossref_primary_10_1111_cgf_13248 wiley_primary_10_1111_cgf_13248_CGF13248 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | August 2017 2017-08-00 20170801 |
| PublicationDateYYYYMMDD | 2017-08-01 |
| PublicationDate_xml | – month: 08 year: 2017 text: August 2017 |
| PublicationDecade | 2010 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | Computer graphics forum |
| PublicationYear | 2017 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | 2007; 29 1991; 23 2013; 32 2002; 23 2006; 69 2015; 21 2011; 33 1995 2015 2008; 30 2003 1998; 95 2016; 35 2014; 33 2005; 24 1999 1987; 16 2009; 28 e_1_2_9_10_2 e_1_2_9_20_2 e_1_2_9_12_2 e_1_2_9_11_2 e_1_2_9_6_2 e_1_2_9_5_2 e_1_2_9_4_2 e_1_2_9_3_2 e_1_2_9_2_2 e_1_2_9_9_2 e_1_2_9_8_2 e_1_2_9_14_2 e_1_2_9_13_2 e_1_2_9_16_2 e_1_2_9_15_2 e_1_2_9_18_2 e_1_2_9_17_2 Kimmel R. (e_1_2_9_7_2) 1999 e_1_2_9_19_2 |
| References_xml | – volume: 32 start-page: 152:1 issue: 5 year: 2013 end-page: 152:11 article-title: Geodesics in heat: A new approach to computing distance based on heat flow publication-title: ACM Trans. Graph – volume: 23 start-page: 183 issue: 2 year: 2002 end-page: 194 article-title: Voronoi diagrams on the sphere publication-title: Computational Geometry – volume: 33 start-page: 1502 issue: 8 year: 2011 end-page: 1517 article-title: Construction of iso‐contours, bisectors, and voronoi diagrams on triangulated surfaces publication-title: Pattern Analysis and Machine Intelligence, IEEE Transactions on – start-page: 62 year: 2015 end-page: 72 – volume: 33 start-page: 161 issue: 7 year: 2014 end-page: 170 article-title: Polyline‐sourced geodesic voronoi diagrams on triangle meshes publication-title: Comput. Graph. Forum – volume: 23 start-page: 345 issue: 3 year: 1991 end-page: 405 article-title: Voronoi diagrams—a survey of a fundamental geometric data structure publication-title: ACM Comput. Surv – start-page: 193 year: 1999 end-page: 202 – volume: 16 start-page: 647 issue: 4 year: 1987 end-page: 668 article-title: The discrete geodesic problem publication-title: SIAM Journal on Computing – volume: 30 start-page: 2204 issue: 12 year: 2008 end-page: 2217 article-title: Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – volume: 28 start-page: 104:1 issue: 4 year: 2009 end-page: 104:8 article-title: Improving chen and han's algorithm on the discrete geodesic problem publication-title: ACM Trans. Graph – volume: 21 start-page: 822 issue: 7 year: 2015 end-page: 834 article-title: Fast wavefront propagation (fwp) for computing exact geodesic distances on meshes publication-title: Visualization and Computer Graphics, IEEE Transactions on – volume: 69 start-page: 145 issue: 1 year: 2006 article-title: Geodesic remeshing using front propagation publication-title: International Journal of Computer Vision – volume: 95 start-page: 8431 issue: 15 year: 1998 end-page: 8435 article-title: Computing geodesic paths on manifolds publication-title: Proceedings of the National Academy of Sciences – volume: 35 start-page: 125:1 issue: 4 year: 2016 end-page: 125:13 article-title: Fast and exact discrete geodesic computation based on triangle‐oriented wavefront propagation publication-title: ACM Trans. Graph – start-page: 533 year: 1995 end-page: 539 – volume: 29 start-page: 437 issue: 3 year: 2007 end-page: 448 article-title: Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension publication-title: IEEE Transactions on Pattern Analysis and Machine Intelligence – volume: 24 start-page: 553 issue: 3 year: 2005 end-page: 560 article-title: Fast exact and approximate geodesics on meshes publication-title: ACM Trans. Graph – start-page: 19 year: 2003 end-page: 24 – volume: 32 start-page: 99:1 issue: 4 year: 2013 end-page: 99:14 article-title: Particle‐based anisotropic surface meshing publication-title: ACM Trans. Graph – ident: e_1_2_9_19_2 doi: 10.1109/TVCG.2015.2407404 – ident: e_1_2_9_11_2 – start-page: 193 volume-title: Proc. of AFA Conf. on Curves and Surfaces year: 1999 ident: e_1_2_9_7_2 – ident: e_1_2_9_14_2 doi: 10.1016/j.cad.2014.08.021 – ident: e_1_2_9_3_2 doi: 10.1109/TPAMI.2007.54 – ident: e_1_2_9_13_2 doi: 10.1007/s11263-006-6859-3 – ident: e_1_2_9_15_2 doi: 10.1145/2897824.2925930 – ident: e_1_2_9_5_2 doi: 10.1109/TPAMI.2008.21 – ident: e_1_2_9_18_2 doi: 10.1145/1559755.1559761 – ident: e_1_2_9_12_2 – ident: e_1_2_9_20_2 doi: 10.1145/2461912.2461946 – ident: e_1_2_9_4_2 doi: 10.1145/2516971.2516977 – ident: e_1_2_9_17_2 doi: 10.1111/cgf.12484 – ident: e_1_2_9_16_2 doi: 10.1145/1073204.1073228 – ident: e_1_2_9_2_2 doi: 10.1145/116873.116880 – ident: e_1_2_9_6_2 doi: 10.1073/pnas.95.15.8431 – ident: e_1_2_9_8_2 doi: 10.1109/TPAMI.2010.221 – ident: e_1_2_9_10_2 doi: 10.1016/S0925-7721(02)00077-9 – ident: e_1_2_9_9_2 doi: 10.1137/0216045 |
| SSID | ssj0004765 |
| Score | 2.237115 |
| Snippet | Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 93 |
| SubjectTerms | Categories and Subject Descriptors (according to ACM CCS) Computation Computer graphics Computer memory Geodesy I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Curve, surface, solid, and object representations Voronoi graphs |
| Title | Fast and Memory‐Efficient Voronoi Diagram Construction on Triangle Meshes |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.13248 https://www.proquest.com/docview/1928374378 |
| Volume | 36 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFA5jJz34W5xOCeJhl47-SLoVTzJXh6IH2WQHoaRpMoejEzoPevJP8G_0L_G9tN2mKIjQQ6EvpX3Jy_te-PKFkBMWO0oGCZSpqs0t5tjCEsLVluspV4q2jTkP2RY3fm_ALod8WCGn5V6YXB9ivuCGkWHmawxwEWdLQS5HugmlFMONvsjVQkB0u5COYi2fl7reqBhTqAohi2fe8msuWgDMZZhq8ky4Tu7LL8zpJY_N51nclK_fxBv_-QsbZK3An_QsHzCbpKLSLbK6pEq4Ta5Ckc2oSBN6jTTcl4-3964RmoD8RO9Q8WA6pudjgbwuigd-lhK0FK4-DOh0NFHQNntQ2Q4ZhN1-p2cVZy5Y0sWCkgdM68Tz2yIIpB3IQAHi00o5QgBwUIJzL9a-bHMuecw1g4Imwc2tIrZdJYXv7ZJqOk3VHqHaTZKW1AGkYZiOWYDYDuYLjbBDaN-pkUbp_UgWguR4LsYkKgsT8E9k_FMjx3PTp1yF4yejetmFURGIWQQAFkpw5rXgccP0xe8viDoXobnZ_7vpAVlxMdEbSmCdVMHj6hBgyiw-MuPxE-Cy40Q |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB6qHtSDb_FtEA9eUppkN03Ai6i12sdBWvEiYbPZrcWSCq0HPfkT_I3-Eme2Sa2iIEIOgeyGZHZn5_uW2W8ADlnsKBkmSFNVwG3mlIQthKtt11OuFEGJYh5lWzT9aptd3fLbAhznZ2FG-hDjDTfyDLNek4PThvSEl8uOLiKXYsEUzFBFb0Oorj_Fo1jZ57myN2nGZLpClMcz7vo1Gn1CzEmgaiJNZRHu8m8cJZg8FJ-GcVG-fJNv_O9PLMFCBkGtk9GcWYaCSldgfkKYcBVqFTEYWiJNrAZl4j6_v76dG60JDFHWDYke9LvWWVdQapdFNT9zFVoLrxbO6bTTU9h3cK8Ga9CunLdOq3ZWdsGWLnFKHjKtE88PRBjKUihDhaBPK-UIgdhBCc69WPsy4FzymGuGnCah860iLrlKCt9bh-m0n6oNsLSbJGWpQ4zEuCKzkOAdLhmakIfQvrMJR7n5I5lpklNpjF6UcxO0T2TsswkH46aPIyGOnxrt5GMYZb44iBDDIgtnXhkfH5nB-P0F0elFxdxs_b3pPsxWW416VL9s1rZhzqW4bzIEd2Aara92EbUM4z0zOT8AF2bnXw |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60gujBt1itGsSDl5Q8dtMET9Ia3yJipQchbDa7tShpofWgJ3-Cv9Ff4kya1CoKIuQQyGxIZufxzTL7LcAui20lgwTLVOVzk9mWMIVwtOm4ypHCtyjnUbfFpXfcZKct3pqA_WIvzJAfYrTgRp6RxWty8F6ix5xctnUVSynmT8IU8yyfTLpx_ckdxWoeL4i9iTImpxWiNp7R0K_J6BNhjuPULNGE83BXfOKwv-Sh-jSIq_LlG3vjP_9hAeZyAGocDC1mESZUugSzY7SEy3AWiv7AEGliXFAf7vP769thxjSBCcq4JcqDbsdodAQ1dhl04mfBQWvgdYMWnbYfFY7t36v-CjTDw5v6sZkfumBKhypKHjCtE9fzRRBIK5CBQsinlbKFQOSgBOdurD3pcy55zDXDiiah3a0ithwlheeuQintpmoNDO0kSU3qAPMwxmMWELjDgKEJdwjt2WXYK7QfyZyRnA7GeIyKygT1E2X6KcPOSLQ3pOH4SahSTGGUe2I_QgSLNThza_h4L5uL318Q1Y_C7Gb976LbMH3VCKPzk8uzDZhxKOln7YEVKKHy1SZClkG8lZnmB5MF5hc |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+and+Memory%E2%80%90Efficient+Voronoi+Diagram+Construction+on+Triangle+Meshes&rft.jtitle=Computer+graphics+forum&rft.au=Qin%2C+Yipeng&rft.au=Yu%2C+Hongchuan&rft.au=Zhang%2C+Jianjun&rft.date=2017-08-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=36&rft.issue=5&rft.spage=93&rft.epage=104&rft_id=info:doi/10.1111%2Fcgf.13248&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_13248 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon |