Surface reconstruction by computing restricted Voronoi cells in parallel
We present a method for reconstructing a 3D surface triangulation from an input point set. The main component of the method is an algorithm that computes the restricted Voronoi diagram. In our specific case, it corresponds to the intersection between the 3D Voronoi diagram of the input points and a...
Saved in:
| Published in | Computer aided design Vol. 90; pp. 123 - 134 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier Ltd
01.09.2017
Elsevier BV Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0010-4485 1879-2685 |
| DOI | 10.1016/j.cad.2017.05.011 |
Cover
| Abstract | We present a method for reconstructing a 3D surface triangulation from an input point set. The main component of the method is an algorithm that computes the restricted Voronoi diagram. In our specific case, it corresponds to the intersection between the 3D Voronoi diagram of the input points and a set of disks centered at the points and orthogonal to the estimated normal directions. The method does not require coherent normal orientations (just directions). Our algorithm is based on a property of the restricted Voronoi cells that leads to an embarrassingly parallel implementation. We experimented our algorithm with scanned point sets with up to 100 million vertices that were processed within few minutes on a standard computer. The complete implementation is provided.
•Simple and scalable surface reconstruction algorithm from 3D point sets.•The algorithm requires only estimated normal directions (no need of consistent normal orientation).•It processes 100 million points within few minutes on a standard computer.•The complete implementation is provided.
[Display omitted] |
|---|---|
| AbstractList | We present a method for reconstructing a 3D surface triangulation from an input point set. The main component of the method is an algorithm that computes the restricted Voronoi diagram. In our specific case, it corresponds to the intersection between the 3D Voronoi diagram of the input points and a set of disks centered at the points and orthogonal to the estimated normal directions. The method does not require coherent normal orientations (just directions). Our algorithm is based on a property of the restricted Voronoi cells that leads to an embarrassingly parallel implementation. We experimented our algorithm with scanned point sets with up to 100 million vertices that were processed within few minutes on a standard computer. The complete implementation is provided. We present a method for reconstructing a 3D surface triangulation from an input point set. The main component of the method is an algorithm that computes the restricted Voronoi diagram. In our specific case, it corresponds to the intersection between the 3D Voronoi diagram of the input points and a set of disks centered at the points and orthogonal to the estimated normal directions. The method does not require coherent normal orientations (just directions). Our algorithm is based on a property of the restricted Voronoi cells that leads to an embarrassingly parallel implementation. We experimented our algorithm with scanned point sets with up to 100 million vertices that were processed within few minutes on a standard computer. The complete implementation is provided. •Simple and scalable surface reconstruction algorithm from 3D point sets.•The algorithm requires only estimated normal directions (no need of consistent normal orientation).•It processes 100 million points within few minutes on a standard computer.•The complete implementation is provided. [Display omitted] |
| Author | Boltcheva, Dobrina Lévy, Bruno |
| Author_xml | – sequence: 1 givenname: Dobrina surname: Boltcheva fullname: Boltcheva, Dobrina email: dobrina.botlcheva@univ-lorraine.fr – sequence: 2 givenname: Bruno surname: Lévy fullname: Lévy, Bruno |
| BackLink | https://inria.hal.science/hal-01596553$$DView record in HAL |
| BookMark | eNp9kTtPwzAUhS1UJNrCD2CLxMSQcG8SJ46YqgooUiUGHqvlOA44Su3iJJX673EUWBg62fI55z4-L8jMWKMIuUaIEDC7ayIpqigGzCOgESCekTmyvAjjjNEZmQMghGnK6AVZdF0DADEmxZxsXgdXC6kCp6Q1Xe8G2WtrgvIYSLvbD702n17zgpa9qoIP66yxOpCqbbtAm2AvnGhb1V6S81q0nbr6PZfk_fHhbb0Jty9Pz-vVNpQpxH0opMhpKdOSFhVTcZmJguZxlVMKRaJqVqO_s6zGFGmesJglFGRJswwYRVXLZElup7pfouV7p3fCHbkVmm9WWz6-AdIiozQ5oPfeTN69s9-DX4I3dnDGj8exSDH3TJLEu_LJJZ3tOqdqLnUvRgq9E7rlCHxEzBvuEfMRMQfq24z18V_yb6BTmfspozykg1aOd1IrI1Wl_Rf0vLL6RPoHD16Ukw |
| CitedBy_id | crossref_primary_10_1145_3533768 crossref_primary_10_1155_2018_4673849 crossref_primary_10_1016_j_cag_2024_103949 crossref_primary_10_1109_TIM_2021_3080385 crossref_primary_10_1109_TVCG_2022_3193406 crossref_primary_10_1109_TVCG_2019_2945961 crossref_primary_10_3390_rs10101607 crossref_primary_10_1016_j_compag_2020_105332 crossref_primary_10_1109_TVCG_2020_3042588 crossref_primary_10_1080_20964471_2018_1432115 crossref_primary_10_1016_j_cagd_2020_101848 crossref_primary_10_2139_ssrn_4177990 crossref_primary_10_1111_cgf_13543 crossref_primary_10_1111_cgf_14897 crossref_primary_10_3390_app122211540 crossref_primary_10_1016_j_cagd_2021_101973 crossref_primary_10_1145_3592129 crossref_primary_10_1155_2020_8670151 crossref_primary_10_1109_TIP_2021_3104174 crossref_primary_10_1016_j_cad_2023_103608 crossref_primary_10_1016_j_cma_2023_116427 crossref_primary_10_1145_3272127_3275092 crossref_primary_10_1145_3687956 crossref_primary_10_1016_j_gmod_2023_101174 crossref_primary_10_1016_j_cad_2023_103511 crossref_primary_10_1109_TPAMI_2022_3185644 crossref_primary_10_1145_3687920 crossref_primary_10_1016_j_jmapro_2023_10_019 crossref_primary_10_1111_coin_12605 crossref_primary_10_3390_rs12142224 crossref_primary_10_1016_j_cagd_2019_04_011 crossref_primary_10_1016_j_cag_2019_08_002 crossref_primary_10_1111_cgf_15019 crossref_primary_10_1016_j_cad_2018_04_010 crossref_primary_10_1016_j_cagd_2023_102216 crossref_primary_10_1007_s11042_020_08923_5 crossref_primary_10_1007_s00371_021_02183_6 crossref_primary_10_1109_TMM_2021_3073265 |
| Cites_doi | 10.1007/s00371-003-0217-z 10.1111/1467-8659.00439 10.1016/j.cad.2011.02.012 10.1016/j.cad.2004.09.011 10.1145/37402.37422 10.1109/TVCG.2003.1175093 10.5201/ipol.2014.81 10.1109/2945.817351 10.1016/j.cag.2006.11.013 10.1111/j.1467-8659.2011.01848.x 10.1145/2487228.2487237 10.1145/174462.156635 10.1016/j.cag.2011.03.014 10.1145/2601097.2601163 10.1145/142920.134011 10.1016/S0925-7721(01)00048-7 10.1007/s00454-013-9557-2 10.1145/2451236.2451246 10.1016/j.gmod.2005.01.004 10.5201/ipol.2015.102 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier Ltd Copyright Elsevier BV Sep 2017 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2017 Elsevier Ltd – notice: Copyright Elsevier BV Sep 2017 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 7TB 8FD F28 FR3 JQ2 KR7 L7M L~C L~D 1XC VOOES |
| DOI | 10.1016/j.cad.2017.05.011 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1879-2685 |
| EndPage | 134 |
| ExternalDocumentID | oai_HAL_hal_01596553v1 10_1016_j_cad_2017_05_011 S0010448517300829 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKC AAIKJ AAKOC AALRI AAMNW AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABFRF ABMAC ABXDB ABYKQ ACAZW ACBEA ACDAQ ACGFO ACGFS ACIWK ACKIV ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA K-O KOM LG9 LY7 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSW SSZ T5K TAE TN5 TWZ VOH WUQ XFK XPP ZMT ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH 7SC 7TB 8FD EFKBS F28 FR3 JQ2 KR7 L7M L~C L~D 1XC VOOES |
| ID | FETCH-LOGICAL-c402t-aca75bc4b59d8e2b6a9572d755093ef8f1d7586f141573828350cb5660851efc3 |
| IEDL.DBID | AIKHN |
| ISSN | 0010-4485 |
| IngestDate | Fri May 09 12:26:22 EDT 2025 Fri Jul 25 08:35:47 EDT 2025 Tue Jul 01 03:34:35 EDT 2025 Thu Apr 24 23:08:58 EDT 2025 Fri Feb 23 02:44:04 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Surface reconstruction Point cloud Restricted Voronoi diagram |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c402t-aca75bc4b59d8e2b6a9572d755093ef8f1d7586f141573828350cb5660851efc3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-7007-3219 |
| OpenAccessLink | https://inria.hal.science/hal-01596553 |
| PQID | 1941701033 |
| PQPubID | 2045267 |
| PageCount | 12 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01596553v1 proquest_journals_1941701033 crossref_citationtrail_10_1016_j_cad_2017_05_011 crossref_primary_10_1016_j_cad_2017_05_011 elsevier_sciencedirect_doi_10_1016_j_cad_2017_05_011 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-09-01 |
| PublicationDateYYYYMMDD | 2017-09-01 |
| PublicationDate_xml | – month: 09 year: 2017 text: 2017-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Computer aided design |
| PublicationYear | 2017 |
| Publisher | Elsevier Ltd Elsevier BV Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier BV – name: Elsevier |
| References | Kuo, Yau (b27) 2005; 37 Curless, Levoy (b10) 1996 Mitra, Nguyen (b18) 2003 Alexa, Behr, Cohen-Or, Fleishman, Levin, Silva (b14) 2003; 9 Dey (b25) 2006 Digne (b51) 2015; 5 Di Angelo, Di Stefano, Giaccari (b33) 2011; 43 Samet (b45) 2005 Amenta, Bern (b21) 1998 Cohen-Steiner, Da (b26) 2004; 20 Kil, Amenta (b40) 2008 Farman institute 3D point sets. URL Stanford computer graphics laboratory. URL Berger, Levine, Nonato, Taubin, Silva (b6) 2013; 32 Allegre, Chaine, Akkouche (b28) 2007; 31 Liepa (b48) 2003 Edelsbrunner (b30) 2003 Dumitriu, Funke, Kutz, Milosavljević (b39) 2010; 14 Large-scale point cloud classification benchmark. URL Ramos, Sadri (b31) 2007 Munkres (b5) 1984 Berger, Tagliasacchi, Seversky, Alliez, Levine, Sharf, Silva (b7) 2014 Ohtake, Belyaev, Alexa (b15) 2005 Gopi, Krishnan (b43) 2002 Shewchuk (b44) 2005 Edelsbrunner, Mücke (b34) 1994; 13 Aim shapes repository. URL Fuhrmann, Goesele (b4) 2014; 33 Manson, Petrova, Schaefer (b12) 2008 Levy, Bonneel (b47) 2012 Smart multiMedia, Inc. URL Funke, Ramos (b37) 2002 Attali, Boissonnat, Lieutier (b41) 2003 Dumitriu, Funke, Kutz, Milosavljević (b38) 2008; vol. 5124 Boissonnat, Oudot (b29) 2005; 67 Kazhdan, Bolitho, Hoppe (b11) 2006 Bernardini, Mittleman, Rushmeier, Silva, Taubin (b32) 1999; 5 Dey, Li, Sun (b19) 2005 Hoppe, DeRose, Duchamp, McDonald, Stuetzle (b8) 1992; 26 Lorensen, Cline (b17) 1987; 21 Amenta, Choi, Dey, Leekha (b22) 2000 Cazals, Giesen (b24) 2006 Digne (b35) 2014; 4 Edelsbrunner, Shah (b20) 1994 Gopi, Krishnan, Silva (b42) 2000; 19 Nagai, Ohtake, Suzuki (b16) 2009 Dey, Dyer, Wang (b1) 2011; 35 Mount, Arya (b46) 1997 Boissonnat, Ghosh (b2) 2014; 51 Statue model repository. URL Boissonnat, Cazals (b9) 2002; 22 Amenta, Choi, Kolluri (b23) 2001 GEOGRAM. URL Kazhdan, Hoppe (b3) 2013; 32 Alliez, Cohen-Steiner, Tong, Desbrun (b13) 2007 Digne, Morel, Souzani, Lartigue (b36) 2011; 30 Munkres (10.1016/j.cad.2017.05.011_b5) 1984 Boissonnat (10.1016/j.cad.2017.05.011_b9) 2002; 22 Kil (10.1016/j.cad.2017.05.011_b40) 2008 Dey (10.1016/j.cad.2017.05.011_b25) 2006 Fuhrmann (10.1016/j.cad.2017.05.011_b4) 2014; 33 Manson (10.1016/j.cad.2017.05.011_b12) 2008 Alexa (10.1016/j.cad.2017.05.011_b14) 2003; 9 Digne (10.1016/j.cad.2017.05.011_b35) 2014; 4 Levy (10.1016/j.cad.2017.05.011_b47) 2012 Cohen-Steiner (10.1016/j.cad.2017.05.011_b26) 2004; 20 Boissonnat (10.1016/j.cad.2017.05.011_b2) 2014; 51 Lorensen (10.1016/j.cad.2017.05.011_b17) 1987; 21 Mount (10.1016/j.cad.2017.05.011_b46) 1997 Gopi (10.1016/j.cad.2017.05.011_b42) 2000; 19 Berger (10.1016/j.cad.2017.05.011_b6) 2013; 32 Alliez (10.1016/j.cad.2017.05.011_b13) 2007 Digne (10.1016/j.cad.2017.05.011_b51) 2015; 5 Amenta (10.1016/j.cad.2017.05.011_b23) 2001 Edelsbrunner (10.1016/j.cad.2017.05.011_b20) 1994 Kazhdan (10.1016/j.cad.2017.05.011_b11) 2006 Dey (10.1016/j.cad.2017.05.011_b19) 2005 Hoppe (10.1016/j.cad.2017.05.011_b8) 1992; 26 Allegre (10.1016/j.cad.2017.05.011_b28) 2007; 31 Di Angelo (10.1016/j.cad.2017.05.011_b33) 2011; 43 Attali (10.1016/j.cad.2017.05.011_b41) 2003 Dumitriu (10.1016/j.cad.2017.05.011_b39) 2010; 14 Amenta (10.1016/j.cad.2017.05.011_b22) 2000 10.1016/j.cad.2017.05.011_b56 Dey (10.1016/j.cad.2017.05.011_b1) 2011; 35 10.1016/j.cad.2017.05.011_b55 10.1016/j.cad.2017.05.011_b54 Digne (10.1016/j.cad.2017.05.011_b36) 2011; 30 10.1016/j.cad.2017.05.011_b53 10.1016/j.cad.2017.05.011_b52 Curless (10.1016/j.cad.2017.05.011_b10) 1996 Boissonnat (10.1016/j.cad.2017.05.011_b29) 2005; 67 10.1016/j.cad.2017.05.011_b50 Samet (10.1016/j.cad.2017.05.011_b45) 2005 Kazhdan (10.1016/j.cad.2017.05.011_b3) 2013; 32 Nagai (10.1016/j.cad.2017.05.011_b16) 2009 Ramos (10.1016/j.cad.2017.05.011_b31) 2007 Bernardini (10.1016/j.cad.2017.05.011_b32) 1999; 5 Edelsbrunner (10.1016/j.cad.2017.05.011_b30) 2003 Mitra (10.1016/j.cad.2017.05.011_b18) 2003 Funke (10.1016/j.cad.2017.05.011_b37) 2002 Berger (10.1016/j.cad.2017.05.011_b7) 2014 Cazals (10.1016/j.cad.2017.05.011_b24) 2006 Dumitriu (10.1016/j.cad.2017.05.011_b38) 2008; vol. 5124 Edelsbrunner (10.1016/j.cad.2017.05.011_b34) 1994; 13 10.1016/j.cad.2017.05.011_b49 Kuo (10.1016/j.cad.2017.05.011_b27) 2005; 37 Shewchuk (10.1016/j.cad.2017.05.011_b44) 2005 Ohtake (10.1016/j.cad.2017.05.011_b15) 2005 Liepa (10.1016/j.cad.2017.05.011_b48) 2003 Gopi (10.1016/j.cad.2017.05.011_b43) 2002 Amenta (10.1016/j.cad.2017.05.011_b21) 1998 |
| References_xml | – start-page: 33 year: 2012 end-page: 40 ident: b47 article-title: Variational anisotropic surface meshing with voronoi parallel linear enumeration publication-title: Proc. of the 21st int. meshing roundtable – volume: 51 start-page: 221 year: 2014 end-page: 267 ident: b2 article-title: Manifold reconstruction using tangential Delaunay complexes publication-title: Discrete Comput Geom – start-page: 303 year: 1996 end-page: 312 ident: b10 article-title: A volumetric method for building complex models from range images publication-title: SIGGRAPH – year: 1984 ident: b5 article-title: Elements of algebraic topology – volume: 30 start-page: 1630 year: 2011 end-page: 1642 ident: b36 article-title: Scale space meshing of raw data point sets publication-title: Comput Graph Forum – volume: 20 start-page: 4 year: 2004 end-page: 16 ident: b26 article-title: A greedy Delaunay-based surface reconstruction algorithm publication-title: Visual Comput – volume: 35 start-page: 483 year: 2011 end-page: 491 ident: b1 article-title: Localized cocone surface reconstruction publication-title: Comput Graph – start-page: 249 year: 2001 end-page: 266 ident: b23 article-title: The power crust publication-title: Proc of the 6th SMA – volume: vol. 5124 start-page: 270 year: 2008 end-page: 281 ident: b38 article-title: On the locality of extracting a 2-manifold in R3 publication-title: 11th scand. workshop on algorithm theory – reference: Aim shapes repository. URL – volume: 9 start-page: 3 year: 2003 end-page: 15 ident: b14 article-title: Computing and rendering point set surfaces publication-title: IEEE Trans Vis Comput Graphics – start-page: 1 year: 2005 end-page: 10 ident: b15 article-title: Sparse low-degree implicit surfaces with applications to high quality rendering, feature extraction, and smoothing publication-title: SGP – volume: 33 start-page: 46:1 year: 2014 end-page: 46:11 ident: b4 article-title: Floating scale surface reconstruction publication-title: ACM Trans Graph – start-page: 1339 year: 2009 end-page: 1348 ident: b16 article-title: Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction publication-title: SGP – volume: 37 start-page: 825 year: 2005 end-page: 835 ident: b27 article-title: A Delaunay-based region-growing approach to surface reconstruction from unorganized points publication-title: Comput Aided Des – volume: 13 start-page: 43 year: 1994 end-page: 72 ident: b34 article-title: Three-dimensional alpha shapes publication-title: ACM Trans Graph – start-page: 369 year: 2008 end-page: 385 ident: b40 article-title: GPU-Assisted surface reconstruction on locally-uniform samples publication-title: IMR – volume: 26 start-page: 71 year: 1992 end-page: 78 ident: b8 article-title: Surface reconstruction from unorganized points publication-title: SIGGRAPH – volume: 22 start-page: 185 year: 2002 end-page: 203 ident: b9 article-title: Smooth surface reconstruction via natural neighbour interpolation of distance functions publication-title: Comput Geom – reference: GEOGRAM. URL – start-page: 379 year: 2003 end-page: 404 ident: b30 article-title: Discrete and computational geometry – volume: 5 start-page: 349 year: 1999 end-page: 359 ident: b32 article-title: The ball-pivoting algorithm for surface reconstruction publication-title: IEEE Trans Vis Comput Graphics – volume: 43 start-page: 639 year: 2011 end-page: 650 ident: b33 article-title: A new mesh-growing algorithm for fast surface reconstruction publication-title: Comput Aided Des – start-page: 33 year: 1997 end-page: 40 ident: b46 article-title: ANN: A library for approximate nearest neighbor searching publication-title: CGC workshop on computational geometry – reference: Smart multiMedia, Inc. URL – reference: Statue model repository. URL – start-page: 39 year: 2005 end-page: 46 ident: b19 article-title: Normal estimation for point clouds: A comparison study for a voronoi based method publication-title: Proc of the conference on point-based graphics – start-page: 322 year: 2003 end-page: 328 ident: b18 article-title: Estimating surface normals in noisy point cloud data publication-title: Proc of the SCG – volume: 21 start-page: 163 year: 1987 end-page: 169 ident: b17 article-title: Marching cubes: A high resolution 3D surface construction algorithm publication-title: SIGGRAPH Comput Graph – volume: 67 start-page: 405 year: 2005 end-page: 451 ident: b29 article-title: Provably good sampling and meshing of surfaces publication-title: Graph Models – start-page: 161 year: 2014 end-page: 185 ident: b7 article-title: State of the art in surface reconstruction from point clouds publication-title: Eurographics – volume: 4 start-page: 149 year: 2014 end-page: 168 ident: b35 article-title: An analysis and implementation of a parallel ball pivoting algorithm publication-title: Image Proc. on Line – start-page: 200 year: 2003 end-page: 205 ident: b48 article-title: Filling holes in meshes publication-title: SGP – volume: 32 start-page: 29:1 year: 2013 end-page: 29:13 ident: b3 article-title: Screened Poisson surface reconstruction publication-title: ACM Trans Graph – start-page: 39 year: 1998 end-page: 48 ident: b21 article-title: Surface reconstruction by Voronoi filtering publication-title: Proc of the 14th annual symposium on computational geometry – start-page: 201 year: 2003 end-page: 210 ident: b41 article-title: Complexity of the delaunay triangulation of points on surfaces: the smooth case publication-title: Proc. of SGP – start-page: 61 year: 2006 end-page: 70 ident: b11 article-title: Poisson surface reconstruction publication-title: Proceedings of the 4th SGP – start-page: 1 year: 2002 end-page: 12 ident: b43 article-title: A fast and efficient projection-based approach for surface reconstruction publication-title: High performance computer graphics, multimedia and visu. – volume: 5 year: 2015 ident: b51 article-title: An implementation and parallelization of the scale-space meshing algorithm publication-title: Image Processing on Line – start-page: 1411 year: 2008 end-page: 1420 ident: b12 article-title: Streaming surface reconstruction using wavelets publication-title: SGP – start-page: 213 year: 2000 end-page: 222 ident: b22 article-title: A simple algorithm for homeomorphic surface reconstruction publication-title: Proc of the 16th SCG – reference: Large-scale point cloud classification benchmark. URL – reference: Farman institute 3D point sets. URL – volume: 14 start-page: 2:2.2 year: 2010 end-page: 2:2.17 ident: b39 article-title: How much geometry it takes to reconstruct a 2-manifold in R3 publication-title: J Exp Algorithmics – year: 2005 ident: b45 article-title: Foundations of multidimensional and metric data structures – reference: Stanford computer graphics laboratory. URL – start-page: 39 year: 2007 end-page: 48 ident: b13 article-title: Voronoi-based variational reconstruction of unoriented point sets publication-title: Proc. of the 5th SGP – start-page: 285 year: 1994 end-page: 292 ident: b20 article-title: Triangulating topological spaces publication-title: Proc of the 10th annual symposium on computational geometry – year: 2006 ident: b25 article-title: Curve and surface reconstruction: Algorithms with mathematical analysis – start-page: 237 year: 2005 end-page: 246 ident: b44 article-title: Star splaying: An algorithm for repairing delaunay triangulations and convex hulls publication-title: SCG – volume: 32 start-page: 20:1 year: 2013 end-page: 20:17 ident: b6 article-title: A benchmark for surface reconstruction publication-title: ACM Trans Graph – volume: 31 start-page: 190 year: 2007 end-page: 204 ident: b28 article-title: A flexible framework for surface reconstruction from large point sets publication-title: Computers Graphics – volume: 19 start-page: 467 year: 2000 end-page: 478 ident: b42 article-title: Surface reconstruction based on lower dimensional localized delaunay triangulation publication-title: Comput Graph Forum – start-page: 1086 year: 2007 end-page: 1095 ident: b31 article-title: Geometric and topological guarantees for the WRAP reconstruction algorithm publication-title: Proc of SODA’07 – start-page: 781 year: 2002 end-page: 790 ident: b37 article-title: Smooth-surface reconstruction in near-linear time publication-title: SODA’02 – start-page: 231 year: 2006 end-page: 273 ident: b24 article-title: Delaunay triangulation based surface reconstruction: Ideas and algorithms publication-title: Effective computational geometry for curves and surfaces – volume: 20 start-page: 4 issue: 1 year: 2004 ident: 10.1016/j.cad.2017.05.011_b26 article-title: A greedy Delaunay-based surface reconstruction algorithm publication-title: Visual Comput doi: 10.1007/s00371-003-0217-z – start-page: 39 year: 2007 ident: 10.1016/j.cad.2017.05.011_b13 article-title: Voronoi-based variational reconstruction of unoriented point sets – start-page: 237 year: 2005 ident: 10.1016/j.cad.2017.05.011_b44 article-title: Star splaying: An algorithm for repairing delaunay triangulations and convex hulls – start-page: 781 year: 2002 ident: 10.1016/j.cad.2017.05.011_b37 article-title: Smooth-surface reconstruction in near-linear time – start-page: 1 year: 2005 ident: 10.1016/j.cad.2017.05.011_b15 article-title: Sparse low-degree implicit surfaces with applications to high quality rendering, feature extraction, and smoothing – volume: 19 start-page: 467 issue: 3 year: 2000 ident: 10.1016/j.cad.2017.05.011_b42 article-title: Surface reconstruction based on lower dimensional localized delaunay triangulation publication-title: Comput Graph Forum doi: 10.1111/1467-8659.00439 – start-page: 161 year: 2014 ident: 10.1016/j.cad.2017.05.011_b7 article-title: State of the art in surface reconstruction from point clouds – start-page: 285 year: 1994 ident: 10.1016/j.cad.2017.05.011_b20 article-title: Triangulating topological spaces – volume: 43 start-page: 639 issue: 6 year: 2011 ident: 10.1016/j.cad.2017.05.011_b33 article-title: A new mesh-growing algorithm for fast surface reconstruction publication-title: Comput Aided Des doi: 10.1016/j.cad.2011.02.012 – volume: 37 start-page: 825 issue: 8 year: 2005 ident: 10.1016/j.cad.2017.05.011_b27 article-title: A Delaunay-based region-growing approach to surface reconstruction from unorganized points publication-title: Comput Aided Des doi: 10.1016/j.cad.2004.09.011 – volume: 21 start-page: 163 issue: 4 year: 1987 ident: 10.1016/j.cad.2017.05.011_b17 article-title: Marching cubes: A high resolution 3D surface construction algorithm publication-title: SIGGRAPH Comput Graph doi: 10.1145/37402.37422 – ident: 10.1016/j.cad.2017.05.011_b55 – ident: 10.1016/j.cad.2017.05.011_b49 – start-page: 39 year: 1998 ident: 10.1016/j.cad.2017.05.011_b21 article-title: Surface reconstruction by Voronoi filtering – year: 2005 ident: 10.1016/j.cad.2017.05.011_b45 – start-page: 231 year: 2006 ident: 10.1016/j.cad.2017.05.011_b24 article-title: Delaunay triangulation based surface reconstruction: Ideas and algorithms – start-page: 39 year: 2005 ident: 10.1016/j.cad.2017.05.011_b19 article-title: Normal estimation for point clouds: A comparison study for a voronoi based method – volume: 9 start-page: 3 issue: 1 year: 2003 ident: 10.1016/j.cad.2017.05.011_b14 article-title: Computing and rendering point set surfaces publication-title: IEEE Trans Vis Comput Graphics doi: 10.1109/TVCG.2003.1175093 – volume: 4 start-page: 149 year: 2014 ident: 10.1016/j.cad.2017.05.011_b35 article-title: An analysis and implementation of a parallel ball pivoting algorithm publication-title: Image Proc. on Line doi: 10.5201/ipol.2014.81 – start-page: 322 year: 2003 ident: 10.1016/j.cad.2017.05.011_b18 article-title: Estimating surface normals in noisy point cloud data – start-page: 379 year: 2003 ident: 10.1016/j.cad.2017.05.011_b30 article-title: Discrete and computational geometry – volume: 5 start-page: 349 year: 1999 ident: 10.1016/j.cad.2017.05.011_b32 article-title: The ball-pivoting algorithm for surface reconstruction publication-title: IEEE Trans Vis Comput Graphics doi: 10.1109/2945.817351 – start-page: 200 year: 2003 ident: 10.1016/j.cad.2017.05.011_b48 article-title: Filling holes in meshes – start-page: 1339 year: 2009 ident: 10.1016/j.cad.2017.05.011_b16 article-title: Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction – volume: 31 start-page: 190 issue: 2 year: 2007 ident: 10.1016/j.cad.2017.05.011_b28 article-title: A flexible framework for surface reconstruction from large point sets publication-title: Computers Graphics doi: 10.1016/j.cag.2006.11.013 – volume: 30 start-page: 1630 issue: 6 year: 2011 ident: 10.1016/j.cad.2017.05.011_b36 article-title: Scale space meshing of raw data point sets publication-title: Comput Graph Forum doi: 10.1111/j.1467-8659.2011.01848.x – start-page: 369 year: 2008 ident: 10.1016/j.cad.2017.05.011_b40 article-title: GPU-Assisted surface reconstruction on locally-uniform samples – start-page: 1 year: 2002 ident: 10.1016/j.cad.2017.05.011_b43 article-title: A fast and efficient projection-based approach for surface reconstruction – ident: 10.1016/j.cad.2017.05.011_b50 – ident: 10.1016/j.cad.2017.05.011_b54 – volume: 32 start-page: 29:1 issue: 3 year: 2013 ident: 10.1016/j.cad.2017.05.011_b3 article-title: Screened Poisson surface reconstruction publication-title: ACM Trans Graph doi: 10.1145/2487228.2487237 – year: 2006 ident: 10.1016/j.cad.2017.05.011_b25 – start-page: 1086 year: 2007 ident: 10.1016/j.cad.2017.05.011_b31 article-title: Geometric and topological guarantees for the WRAP reconstruction algorithm – start-page: 249 year: 2001 ident: 10.1016/j.cad.2017.05.011_b23 article-title: The power crust – start-page: 33 year: 1997 ident: 10.1016/j.cad.2017.05.011_b46 article-title: ANN: A library for approximate nearest neighbor searching – ident: 10.1016/j.cad.2017.05.011_b56 – start-page: 201 year: 2003 ident: 10.1016/j.cad.2017.05.011_b41 article-title: Complexity of the delaunay triangulation of points on surfaces: the smooth case – start-page: 1411 year: 2008 ident: 10.1016/j.cad.2017.05.011_b12 article-title: Streaming surface reconstruction using wavelets – volume: 13 start-page: 43 issue: 1 year: 1994 ident: 10.1016/j.cad.2017.05.011_b34 article-title: Three-dimensional alpha shapes publication-title: ACM Trans Graph doi: 10.1145/174462.156635 – start-page: 213 year: 2000 ident: 10.1016/j.cad.2017.05.011_b22 article-title: A simple algorithm for homeomorphic surface reconstruction – start-page: 61 year: 2006 ident: 10.1016/j.cad.2017.05.011_b11 article-title: Poisson surface reconstruction – volume: vol. 5124 start-page: 270 year: 2008 ident: 10.1016/j.cad.2017.05.011_b38 article-title: On the locality of extracting a 2-manifold in R3 – start-page: 33 year: 2012 ident: 10.1016/j.cad.2017.05.011_b47 article-title: Variational anisotropic surface meshing with voronoi parallel linear enumeration – ident: 10.1016/j.cad.2017.05.011_b53 – volume: 35 start-page: 483 issue: 3 year: 2011 ident: 10.1016/j.cad.2017.05.011_b1 article-title: Localized cocone surface reconstruction publication-title: Comput Graph doi: 10.1016/j.cag.2011.03.014 – volume: 33 start-page: 46:1 issue: 4 year: 2014 ident: 10.1016/j.cad.2017.05.011_b4 article-title: Floating scale surface reconstruction publication-title: ACM Trans Graph doi: 10.1145/2601097.2601163 – volume: 26 start-page: 71 issue: 2 year: 1992 ident: 10.1016/j.cad.2017.05.011_b8 article-title: Surface reconstruction from unorganized points publication-title: SIGGRAPH doi: 10.1145/142920.134011 – ident: 10.1016/j.cad.2017.05.011_b52 – volume: 22 start-page: 185 issue: 1–3 year: 2002 ident: 10.1016/j.cad.2017.05.011_b9 article-title: Smooth surface reconstruction via natural neighbour interpolation of distance functions publication-title: Comput Geom doi: 10.1016/S0925-7721(01)00048-7 – volume: 14 start-page: 2:2.2 year: 2010 ident: 10.1016/j.cad.2017.05.011_b39 article-title: How much geometry it takes to reconstruct a 2-manifold in R3 publication-title: J Exp Algorithmics – volume: 51 start-page: 221 issue: 1 year: 2014 ident: 10.1016/j.cad.2017.05.011_b2 article-title: Manifold reconstruction using tangential Delaunay complexes publication-title: Discrete Comput Geom doi: 10.1007/s00454-013-9557-2 – volume: 32 start-page: 20:1 issue: 2 year: 2013 ident: 10.1016/j.cad.2017.05.011_b6 article-title: A benchmark for surface reconstruction publication-title: ACM Trans Graph doi: 10.1145/2451236.2451246 – volume: 67 start-page: 405 issue: 5 year: 2005 ident: 10.1016/j.cad.2017.05.011_b29 article-title: Provably good sampling and meshing of surfaces publication-title: Graph Models doi: 10.1016/j.gmod.2005.01.004 – volume: 5 year: 2015 ident: 10.1016/j.cad.2017.05.011_b51 article-title: An implementation and parallelization of the scale-space meshing algorithm publication-title: Image Processing on Line doi: 10.5201/ipol.2015.102 – year: 1984 ident: 10.1016/j.cad.2017.05.011_b5 – start-page: 303 year: 1996 ident: 10.1016/j.cad.2017.05.011_b10 article-title: A volumetric method for building complex models from range images |
| SSID | ssj0002139 |
| Score | 2.4232044 |
| Snippet | We present a method for reconstructing a 3D surface triangulation from an input point set. The main component of the method is an algorithm that computes the... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 123 |
| SubjectTerms | 3-D printers Algorithms CAD Computational Geometry Computer aided design Computer Science Disks Point cloud Restricted Voronoi diagram Surface reconstruction Triangulation Voronoi graphs |
| Title | Surface reconstruction by computing restricted Voronoi cells in parallel |
| URI | https://dx.doi.org/10.1016/j.cad.2017.05.011 https://www.proquest.com/docview/1941701033 https://inria.hal.science/hal-01596553 |
| Volume | 90 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB7c9aIH8Ymr6xLEk1Btm6SP47Io9bUXH3gLTZriyrK7-AIv_nZn2nRRQQ_e2pC0YZJ8-aadfANwkPjWcJMXnixC6QnBuZcgQnpWxLYw6ADonM4OXw2j7Fac38v7BRg0Z2EorNJhf43pFVq7kmNnzePZaERnfNGVEJRbnlcnRFuwGPI0km1Y7J9dZMM5IIcBr1kwQg41aH5uVmFe2E8K8HL6ncFv21PrgeIkf8B1tQedrsKKI4-sX_dvDRbsZB2Wv0gKbkB2_fpU5sayytOdq8My_c5MlcABazHKx4H4h2ST3ZGCwXTE6AP-MxtNGGmBj8d2vAm3pyc3g8xz2RI8gz7gi5ebPJbaCC3TIrGhjvJUxmERowuSclsmZYDXSVQGuGXHPCGdNd9oZHNEumxp-Ba0J9OJ3QZW5rKMJAJfoHGNS50iiZI6t1qWyJgS0QG_MZIyTkqcMlqMVRMz9qjQrorsqnyp0K4dOJw3mdU6Gn9VFo3l1bfJoBDn_2q2j6M0fzwJZ2f9S0VlSHpwZkj-hpW6zSAqt1yfVZAK0qX3Od_536t3YYnu6uCzLrRxdO0espUX3YPW0UfQc3PyEz6Q5os |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELbaMgAD4ikKBSzEhBSa1HYeY1VRBWi70KJuVuw4IqhqK1qQWPjt3OVRHhIMbJFjJ9bZ_vxdcv6OkAvfNprpKLZE3BIW54xZPiCkZbhnYg0OgIrw7HB_4IYjfjsW4wrplGdhMKyywP4c0zO0LkqahTWb8zTFM77gSnDMLc-yE6JVssYF8zCu7-r9M86j5bCcAwPgYPXy12YW5AW9xPCuQr3T-W1zqj5ilOQPsM52oO422SqoI23nvdshFTPdJZtfBAX3SHj_8pxE2tDMz11pw1L1RnWWvgFqUczGAegHVJM-oH7BLKX4-X5B0ylFJfDJxEz2yah7PeyEVpErwdLgAS6tSEeeUJorEcS-aSk3CoTXij1wQAJmEj9x4Np3Ewc2bI_5qLJmawVcDimXSTQ7ILXpbGoOCU0ikbgCYM9RsMKFCoBCCRUZJRLgSz6vE7s0ktSFkDjms5jIMmLsSYJdJdpV2kKCXevkctVknqto_FWZl5aX36aCBJT_q9k5jNLq8SibHbZ7EsuA8gSuEOwVKjXKQZTFYl1IJ-CoSm8zdvS_V5-R9XDY78nezeDumGzgnTwMrUFqMNLmBHjLUp1m8_IDKtHnVg |
| 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=Surface+reconstruction+by+computing+restricted+Voronoi+cells+in+parallel&rft.jtitle=Computer+aided+design&rft.au=Boltcheva%2C+Dobrina&rft.au=L%C3%A9vy%2C+Bruno&rft.date=2017-09-01&rft.pub=Elsevier+BV&rft.issn=0010-4485&rft.eissn=1879-2685&rft.volume=90&rft.spage=123&rft_id=info:doi/10.1016%2Fj.cad.2017.05.011&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-4485&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-4485&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-4485&client=summon |