Watertight Scenes from Urban LiDAR and Planar Surfaces

The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require a detailed, yet concise representation of the scene's surfaces. Related...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 32; no. 5; pp. 217 - 228
Main Authors:	van Kreveld, M., van Lankveld, T., Veltkamp, R. C.
Format:	Journal Article
Language:	English
Published:	Oxford, UK Blackwell Publishing Ltd 01.08.2013 Wiley
Subjects:	Approximation Cognitive science Computer based modeling Computer graphics Computer Graphics [I.3.5]: Computational Geometry and Object Modeling-Geometric algorithms: Surface and solid representations Computer Graphics [I.3.7]: Three-dimensional Graphics and Realism-Visible line/surface algorithms Computer science Demand Lasers Lidar Mathematical models Remote sensing Risk Studies Urban environments Visibility Visualization United States > US
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require a detailed, yet concise representation of the scene's surfaces. Related work generally either approximates the data with the risk of over‐smoothing, or interpolates the data with excessive detail. Many surfaces in urban scenes can be modeled more concisely by planar approximations. We present a method that combines these polygons into a watertight model. The polygon‐based shape is closed with free‐form meshes based on visibility information. To achieve this, we divide 3‐space into inside and outside volumes by combining a constrained Delaunay tetrahedralization with a graph‐cut. We compare our method with related work on several large urban LiDAR data sets. We construct similar shapes with a third fewer triangles to model the scenes. Additionally, our results are more visually pleasing and closer to a human modeler's description of urban scenes using simple boxes.
AbstractList	The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require a detailed, yet concise representation of the scene's surfaces. Related work generally either approximates the data with the risk of over-smoothing, or interpolates the data with excessive detail. Many surfaces in urban scenes can be modeled more concisely by planar approximations. We present a method that combines these polygons into a watertight model. The polygon-based shape is closed with free-form meshes based on visibility information. To achieve this, we divide 3-space into inside and outside volumes by combining a constrained Delaunay tetrahedralization with a graph-cut. We compare our method with related work on several large urban LiDAR data sets. We construct similar shapes with a third fewer triangles to model the scenes. Additionally, our results are more visually pleasing and closer to a human modeler's description of urban scenes using simple boxes. [PUBLICATION ABSTRACT] The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require a detailed, yet concise representation of the scene's surfaces. Related work generally either approximates the data with the risk of over-smoothing, or interpolates the data with excessive detail. Many surfaces in urban scenes can be modeled more concisely by planar approximations. We present a method that combines these polygons into a watertight model. The polygon-based shape is closed with free-form meshes based on visibility information. To achieve this, we divide 3-space into inside and outside volumes by combining a constrained Delaunay tetrahedralization with a graph-cut. We compare our method with related work on several large urban LiDAR data sets. We construct similar shapes with a third fewer triangles to model the scenes. Additionally, our results are more visually pleasing and closer to a human modeler's description of urban scenes using simple boxes.
Author	Veltkamp, R. C. van Kreveld, M. van Lankveld, T.
Author_xml	– sequence: 1 givenname: M. surname: van Kreveld fullname: van Kreveld, M. organization: Department of Information and Computing Sciences, Utrecht University, The Netherlands – sequence: 2 givenname: T. surname: van Lankveld fullname: van Lankveld, T. organization: Geometrica, Inria - Sophia Antipolis, France – sequence: 3 givenname: R. C. surname: Veltkamp fullname: Veltkamp, R. C. organization: Department of Information and Computing Sciences, Utrecht University, The Netherlands
BackLink	https://inria.hal.science/hal-00862747$$DView record in HAL
BookMark	eNp9kEtPGzEQxy0EUkPood9gJS7tYYPt9WP3mKaQIIWHIChHa-zYwXSzS-0Nj2-PIRSkSO1cZjT6_efx30e7TdtYhL4RPCApjszSDQglZbmDeoQJmZeCV7uoh0mqJeb8C9qP8Q5jzKTgPSTm0NnQ-eVtl10b29iYudCuspugocmm_tfwKoNmkV3W0EDIrtfBgbHxAO05qKP9-p776ObkeDaa5NOL8eloOM0Nl7LMNXMMdOWAFqXReiEWnBpqS201VJQSTA0ANhYYKRaSibKqsMPMCG0ccVYXffRjM_cWanUf_ArCs2rBq8lwql57GJeCSiYfSGK_b9j70P5Z29iplY_G1uly266jIqyopKgk5wk93ELv2nVo0ieJooJQgYvic7kJbYzBuo8LCFavbqvktnpzO7FHW6zxHXS-bboAvv6f4tHX9vnfo9VofPJXkW8UPnb26UMB4bcSspBczc_HajYfz8Tk55maFy_b0p9m
CitedBy_id	crossref_primary_10_14358_PERS_23_00007R3 crossref_primary_10_1111_cgf_12431 crossref_primary_10_1111_cgf_12188 crossref_primary_10_1111_cgf_12802
Cites_doi	10.1111/j.1467-8659.2010.01782.x 10.1145/276884.276893 10.1109/TPAMI.2004.60 10.1006/jagm.1995.1021 10.1145/48014.61051 10.1007/3-540-29090-7_9 10.1007/978-3-540-33259-6_6 10.1007/978-3-540-74198-5_37 10.1109/TIT.1983.1056714 10.1111/j.1467-8659.2011.02029.x 10.1111/j.1467-8659.2009.01512.x 10.1145/336154.336207 10.1109/CVPR.2010.5539824 10.1145/777792.777821 10.1111/cgf.12188 10.1145/383259.383266 10.1145/1015706.1015816 10.1111/j.1467-8659.2007.01016.x 10.1111/j.1467-8659.2009.01530.x 10.1111/j.1467-8659.2009.01389.x 10.1145/781606.781627 10.1145/1882261.1866176 10.1145/357346.357349
ContentType	Journal Article
Copyright	2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd. Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd. – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3 KR7 1XC VOOES
DOI	10.1111/cgf.12188
DatabaseName	Istex 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database Civil Engineering Abstracts Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
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 Civil Engineering Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Computer and Information Systems Abstracts Civil Engineering Abstracts CrossRef
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1467-8659
EndPage	228
ExternalDocumentID	oai:HAL:hal-00862747v1 3048788491 10_1111_cgf_12188 CGF12188 ark_67375_WNG_TWGT6HBM_W
Genre	article Feature
GeographicLocations	United States--US
GeographicLocations_xml	– name: United States--US
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 AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR 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 BSCLL 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 WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3 KR7 1XC VOOES
ID	FETCH-LOGICAL-c5778-b4f4ab9fa238cbbd6d52c2e8beba922102caa0cea413d7468990f04c6bcf1feb3
IEDL.DBID	DRFUL
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000323204000022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0167-7055
IngestDate	Tue Oct 14 20:45:27 EDT 2025 Tue Aug 05 11:05:22 EDT 2025 Fri Jul 25 05:43:21 EDT 2025 Tue Nov 18 22:20:23 EST 2025 Sat Nov 29 03:41:09 EST 2025 Wed Aug 20 07:26:23 EDT 2025 Sun Sep 21 06:16:39 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	5
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-c5778-b4f4ab9fa238cbbd6d52c2e8beba922102caa0cea413d7468990f04c6bcf1feb3
Notes	ark:/67375/WNG-TWGT6HBM-W istex:681680EEE5B77A2A372E1598F59140FD0FA3CC28 ArticleID:CGF12188 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
OpenAccessLink	https://inria.hal.science/hal-00862747
PQID	1426126033
PQPubID	30877
PageCount	12
ParticipantIDs	hal_primary_oai_HAL_hal_00862747v1 proquest_miscellaneous_1439769755 proquest_journals_1426126033 crossref_primary_10_1111_cgf_12188 crossref_citationtrail_10_1111_cgf_12188 wiley_primary_10_1111_cgf_12188_CGF12188 istex_primary_ark_67375_WNG_TWGT6HBM_W
PublicationCentury	2000
PublicationDate	August 2013
PublicationDateYYYYMMDD	2013-08-01
PublicationDate_xml	– month: 08 year: 2013 text: August 2013
PublicationDecade	2010
PublicationPlace	Oxford, UK
PublicationPlace_xml	– name: Oxford, UK – name: Oxford
PublicationTitle	Computer graphics forum
PublicationYear	2013
Publisher	Blackwell Publishing Ltd Wiley
Publisher_xml	– name: Blackwell Publishing Ltd – name: Wiley
References	Van Kreveld M., Van Lankveld T., Veltkamp R. C.: On the shape of a set of points and lines in the plane. Comp. Graph. Forum 30, 5 (2011), 1553-1562. 2, 10. Edelsbrunner H., Kirkpatrick D. G., Seidel R.: On the shape of a set of points in the plane. In IEEE Trans. Inf. Th. (1983), vol. 29, pp. 551-559. 2. Labatut P., Pons J.-P., Keriven R.: Robust and efficient surface reconstruction from range data. Comp. Graph. Forum 28, 8 (2009), 2275-2290. 2, 8, 9, 10, 11. Shalom S., Shamir A., Zhang H., Cohen-Or D.: Cone carving for surface reconstruction. ACM Trans. Graph. 29, 6 (2010), 150:1-150:10. 2. Schnabel R., Degener P., Klein R.: Completion and reconstruction with primitive shapes. Comp. Graph. Forum 28 (2009), 503-512. 2. Van Kreveld M., Van Lankveld T., Veltkamp R. C.: Watertight Scenes from Urban LiDAR and Planar Surfaces. Tech. Rep. UU-CS-2013-007, Utrecht University, Department of Information and Computing Sciences, 2013. 7. Shen C., O'Brien J. F., Shewchuk J. R.: Interpolating and approximating implicit surfaces from polygon soup. ACM Trans. Graph. 23, 3 (2004), 896-904. 2. Tarsha-kurdi F., Grussenmeyer P.: Hough-transform and extended RANSAC algorithms for automatic detection of 3D building roof planes from lidar data. In IAPRS (2007), vol. 36. 2. Goldberg A. V., Tarjan R. E.: A new approach to the maximum-flow problem. J. ACM 35, 4 (1988), 921-940. 8. Mullen P., De Goes F., Desbrun M., Cohen-Steiner D., Alliez P.: Signing the unsigned: robust surface reconstruction from raw pointsets. Comp. Graph. Forum 29, 5 (2010), 1733-1741. 2. Schnabel R., Wahl R., Klein R.: Efficient RANSAC for point-cloud shape detection. Comp. Graph. Forum 26, 2 (2007), 214-226. 2. Boykov Y., Kolmogorov V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI 26, 9 (2004), 1124-1137. 8. Ruppert J.: A delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Alg. 18, 3 (1995), 548-585. 6. Aichholzer O., Aurenhammer F., Kornberger B., Plantinga S., Rote G., Sturm A., Vegter G.: Recovering structure from r-sampled objects. Comp. Graph. Forum 28, 5 (2009), 1349-1360. 2. Boissonnat J.-D.: Geometric structures for three-dimensional shape representation. ACM Trans. Graph. 3, 4 (1984), 266-286. 2. Dinic E. A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady 11 (1970), 1277-1280. 8. 2001 2012 2000 1984; 3 2010 2010; 29 2004; 26 2004; 23 1998 1970; 11 2011; 30 2007 1996 2006 1988; 35 2005 2003 2013 1995; 18 2002 1983; 29 2007; 36 2007; 26 2009; 28 Dinic E. A. (e_1_2_8_13_2) 1970; 11 e_1_2_8_27_2 e_1_2_8_28_2 e_1_2_8_29_2 e_1_2_8_23_2 e_1_2_8_24_2 e_1_2_8_25_2 e_1_2_8_26_2 e_1_2_8_9_2 Tarsha‐kurdi F. (e_1_2_8_30_2) 2007; 36 e_1_2_8_2_2 e_1_2_8_4_2 e_1_2_8_3_2 e_1_2_8_6_2 e_1_2_8_5_2 e_1_2_8_8_2 Van Kreveld M. (e_1_2_8_33_2) 2013 e_1_2_8_7_2 e_1_2_8_20_2 e_1_2_8_21_2 e_1_2_8_22_2 e_1_2_8_16_2 e_1_2_8_17_2 e_1_2_8_18_2 e_1_2_8_19_2 e_1_2_8_12_2 e_1_2_8_14_2 e_1_2_8_15_2 e_1_2_8_31_2 e_1_2_8_10_2 e_1_2_8_11_2 e_1_2_8_32_2
References_xml	– reference: Boykov Y., Kolmogorov V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI 26, 9 (2004), 1124-1137. 8. – reference: Schnabel R., Wahl R., Klein R.: Efficient RANSAC for point-cloud shape detection. Comp. Graph. Forum 26, 2 (2007), 214-226. 2. – reference: Schnabel R., Degener P., Klein R.: Completion and reconstruction with primitive shapes. Comp. Graph. Forum 28 (2009), 503-512. 2. – reference: Van Kreveld M., Van Lankveld T., Veltkamp R. C.: Watertight Scenes from Urban LiDAR and Planar Surfaces. Tech. Rep. UU-CS-2013-007, Utrecht University, Department of Information and Computing Sciences, 2013. 7. – reference: Labatut P., Pons J.-P., Keriven R.: Robust and efficient surface reconstruction from range data. Comp. Graph. Forum 28, 8 (2009), 2275-2290. 2, 8, 9, 10, 11. – reference: Van Kreveld M., Van Lankveld T., Veltkamp R. C.: On the shape of a set of points and lines in the plane. Comp. Graph. Forum 30, 5 (2011), 1553-1562. 2, 10. – reference: Goldberg A. V., Tarjan R. E.: A new approach to the maximum-flow problem. J. ACM 35, 4 (1988), 921-940. 8. – reference: Edelsbrunner H., Kirkpatrick D. G., Seidel R.: On the shape of a set of points in the plane. In IEEE Trans. Inf. Th. (1983), vol. 29, pp. 551-559. 2. – reference: Tarsha-kurdi F., Grussenmeyer P.: Hough-transform and extended RANSAC algorithms for automatic detection of 3D building roof planes from lidar data. In IAPRS (2007), vol. 36. 2. – reference: Boissonnat J.-D.: Geometric structures for three-dimensional shape representation. ACM Trans. Graph. 3, 4 (1984), 266-286. 2. – reference: Shalom S., Shamir A., Zhang H., Cohen-Or D.: Cone carving for surface reconstruction. ACM Trans. Graph. 29, 6 (2010), 150:1-150:10. 2. – reference: Mullen P., De Goes F., Desbrun M., Cohen-Steiner D., Alliez P.: Signing the unsigned: robust surface reconstruction from raw pointsets. Comp. Graph. Forum 29, 5 (2010), 1733-1741. 2. – reference: Shen C., O'Brien J. F., Shewchuk J. R.: Interpolating and approximating implicit surfaces from polygon soup. ACM Trans. Graph. 23, 3 (2004), 896-904. 2. – reference: Aichholzer O., Aurenhammer F., Kornberger B., Plantinga S., Rote G., Sturm A., Vegter G.: Recovering structure from r-sampled objects. Comp. Graph. Forum 28, 5 (2009), 1349-1360. 2. – reference: Dinic E. A.: Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady 11 (1970), 1277-1280. 8. – reference: Ruppert J.: A delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Alg. 18, 3 (1995), 548-585. 6. – volume: 26 start-page: 1124 issue: 9 year: 2004 end-page: 1137 article-title: An experimental comparison of min‐cut/max‐flow algorithms for energy minimization in vision publication-title: PAMI – volume: 29 start-page: 1733 issue: 5 year: 2010 end-page: 1741 article-title: Signing the unsigned: robust surface reconstruction from raw pointsets publication-title: Comp. Graph. Forum – volume: 3 start-page: 266 issue: 4 year: 1984 end-page: 286 article-title: Geometric structures for three‐dimensional shape representation publication-title: ACM Trans. Graph. – start-page: 76 year: 1998 end-page: 85 – volume: 29 start-page: 150:1 issue: 6 year: 2010 end-page: 150:10 article-title: Cone carving for surface reconstruction publication-title: ACM Trans. Graph. – start-page: 147 year: 2005 end-page: 163 – start-page: 231 year: 2006 end-page: 276 – start-page: 127 year: 2003 end-page: 134 – volume: 28 start-page: 503 year: 2009 end-page: 512 article-title: Completion and reconstruction with primitive shapes publication-title: Comp. Graph. Forum – start-page: 193 year: 2002 end-page: 204 – volume: 11 start-page: 1277 year: 1970 end-page: 1280 article-title: Algorithm for solution of a problem of maximum flow in networks with power estimation publication-title: Soviet Mathematics Doklady – volume: 18 start-page: 548 issue: 3 year: 1995 end-page: 585 article-title: A delaunay refinement algorithm for quality 2‐dimensional mesh generation publication-title: J. Alg. – volume: 23 start-page: 896 issue: 3 year: 2004 end-page: 904 article-title: Interpolating and approximating implicit surfaces from polygon soup publication-title: ACM Trans. Graph. – start-page: 213 year: 2000 end-page: 222 – start-page: 39 year: 2007 end-page: 48 – volume: 35 start-page: 921 issue: 4 year: 1988 end-page: 940 article-title: A new approach to the maximum‐flow problem publication-title: J. ACM – volume: 36 year: 2007 article-title: Hough‐transform and extended RANSAC algorithms for automatic detection of 3D building roof planes from lidar data publication-title: IAPRS – volume: 30 start-page: 1553 issue: 5 year: 2011 end-page: 1562 article-title: On the shape of a set of points and lines in the plane publication-title: Comp. Graph. Forum – year: 2012 – start-page: 181 year: 2003 end-page: 190 – volume: 28 start-page: 1349 issue: 5 year: 2009 end-page: 1360 article-title: Recovering structure from r‐sampled objects publication-title: Comp. Graph. Forum – start-page: 1261 year: 2010 end-page: 1268 – start-page: 479 year: 2007 end-page: 492 – start-page: 47 year: 1996 end-page: 61 – start-page: 67 year: 2001 end-page: 76 – volume: 29 start-page: 551 year: 1983 end-page: 559 article-title: On the shape of a set of points in the plane publication-title: IEEE Trans. Inf. Th. – volume: 28 start-page: 2275 issue: 8 year: 2009 end-page: 2290 article-title: Robust and efficient surface reconstruction from range data publication-title: Comp. Graph. Forum – volume: 26 start-page: 214 issue: 2 year: 2007 end-page: 226 article-title: Efficient RANSAC for point‐cloud shape detection publication-title: Comp. Graph. Forum – year: 2013 – ident: e_1_2_8_5_2 – ident: e_1_2_8_19_2 doi: 10.1111/j.1467-8659.2010.01782.x – ident: e_1_2_8_16_2 – ident: e_1_2_8_24_2 doi: 10.1145/276884.276893 – ident: e_1_2_8_6_2 doi: 10.1109/TPAMI.2004.60 – ident: e_1_2_8_21_2 doi: 10.1006/jagm.1995.1021 – ident: e_1_2_8_17_2 doi: 10.1145/48014.61051 – ident: e_1_2_8_23_2 doi: 10.1007/3-540-29090-7_9 – ident: e_1_2_8_15_2 – ident: e_1_2_8_9_2 doi: 10.1007/978-3-540-33259-6_6 – ident: e_1_2_8_31_2 doi: 10.1007/978-3-540-74198-5_37 – ident: e_1_2_8_14_2 doi: 10.1109/TIT.1983.1056714 – ident: e_1_2_8_32_2 doi: 10.1111/j.1467-8659.2011.02029.x – ident: e_1_2_8_2_2 doi: 10.1111/j.1467-8659.2009.01512.x – ident: e_1_2_8_3_2 doi: 10.1145/336154.336207 – ident: e_1_2_8_10_2 doi: 10.1109/CVPR.2010.5539824 – volume: 36 year: 2007 ident: e_1_2_8_30_2 article-title: Hough‐transform and extended RANSAC algorithms for automatic detection of 3D building roof planes from lidar data publication-title: IAPRS – volume: 11 start-page: 1277 year: 1970 ident: e_1_2_8_13_2 article-title: Algorithm for solution of a problem of maximum flow in networks with power estimation publication-title: Soviet Mathematics Doklady – ident: e_1_2_8_26_2 doi: 10.1145/777792.777821 – volume-title: Watertight Scenes from Urban LiDAR and Planar Surfaces year: 2013 ident: e_1_2_8_33_2 doi: 10.1111/cgf.12188 – ident: e_1_2_8_11_2 – ident: e_1_2_8_20_2 – ident: e_1_2_8_8_2 doi: 10.1145/383259.383266 – ident: e_1_2_8_27_2 doi: 10.1145/1015706.1015816 – ident: e_1_2_8_29_2 doi: 10.1111/j.1467-8659.2007.01016.x – ident: e_1_2_8_18_2 doi: 10.1111/j.1467-8659.2009.01530.x – ident: e_1_2_8_25_2 – ident: e_1_2_8_22_2 doi: 10.1111/j.1467-8659.2009.01389.x – ident: e_1_2_8_12_2 doi: 10.1145/781606.781627 – ident: e_1_2_8_28_2 doi: 10.1145/1882261.1866176 – ident: e_1_2_8_7_2 doi: 10.1145/357346.357349 – ident: e_1_2_8_4_2
SSID	ssj0004765
Score	2.0790968
Snippet	The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images...
SourceID	hal proquest crossref wiley istex
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	217
SubjectTerms	Approximation Cognitive science Computer based modeling Computer graphics Computer Graphics [I.3.5]: Computational Geometry and Object Modeling-Geometric algorithms: Surface and solid representations Computer Graphics [I.3.7]: Three-dimensional Graphics and Realism-Visible line/surface algorithms Computer science Demand Lasers Lidar Mathematical models Remote sensing Risk Studies Urban environments Visibility Visualization
Title	Watertight Scenes from Urban LiDAR and Planar Surfaces
URI	https://api.istex.fr/ark:/67375/WNG-TWGT6HBM-W/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12188 https://www.proquest.com/docview/1426126033 https://www.proquest.com/docview/1439769755 https://inria.hal.science/hal-00862747
Volume	32
WOSCitedRecordID	wos000323204000022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library - Journals customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEB61CQc4UJ6qoUULQohLJNfel8UpbUlyCBFqE6U3a3a9CxWVi5ym4uez49huKoGExM3yji17ZmdnPnv2G4D31nORZT4eWGGSAS_SeIAJ9dBQnCv06FK_aTahZjN9cZF93YFP7V6YDT9E98GNPKNer8nB0ay2nNx-80SNoPUu9JMwb3kP-qdno8X0blukkqKl9ibSmIZYiAp5uovvhaPd71QM2Sf9_rqXcW7nrXXgGe391yM_gcdNvsmGmwnyFHZc-QwebbEQPge5RCoMIJTOzi2tfYw2nbBFZbBk08vT4RnDsmDU3wgrdr6uPNVxvYDF6PP8ZDJo2ikEO6iAFQ33HE3mMURpa0whC5HYxGnjDGYJQT-LGFuHIa4VisuAxGIfcyuN9Uc-gO6X0CuvS7cPzGYcXYzCpE5zq8NNpfCp0pk2upA6juBjq9XcNlzj1PLiKm8xR1BFXqsigned6M8NwcYfhYJpunGixJ4MpzmdqzFZwES3RxF8qC3XiWH1g8rWlMiXs3E-X47ncnL8JV9GcNCaNm88dhUgEJGpyThNI3jbDQdfox8oWLrrNclQ9pYpIcIL1ob--yPnJ-NRffDq30Vfw8Ok7rZB9YUH0Lup1u4QHtjbm8tV9aaZ3r8By7n6iA
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED9tLRLwwOcQYQMMQoiXSlnir0h7KRttEVmFtlbdm2U7NkybMpSt0_78-dIkdBJISLxF8SVy7nw-_5zz7wA-WE9Zlvl4YJlJBrRI44FOsIaGoFRor13qV8UmxHQqT06y7xuw156FWfFDdBtu6Bn1fI0OjhvSa15uf3jkRpByE_o0DCPWg_7B0Wie_z4XKThrub2RNaZhFsJMnu7hO_Fo8ydmQ_ZRwTd3lpzrC9c68owe_1-fn8CjZsVJhqsh8hQ2XPkMHq7xED4HvtCYGoA4nRxbnP0IHjsh88rokuSnB8MjosuCYIUjXZHjZeUxk2sL5qMvs_3JoCmoECwhAlo01FNtMq9DnLbGFLxgiU2cNM7oLEHwZ7WOrdMhshWC8oDFYh9Ty431uz7A7hfQKy9K9xKIzah2sWYmdZJaGV7KmU-FzKSRBZdxBJ9atSrbsI1j0Ytz1aKOoApVqyKC953orxXFxh-Fgm26diTFngxzhfdqVBZQ0fVuBB9r03ViujrDxDXB1GI6VrPFeMYnnw_VIoKd1raq8dnLAIKQTo3HaRrBu645eBv-QtGlu1iiDK7fMsFY-MDa0n_vstofj-qLV_8u-hbuT2aHucq_Tr9tw4Okrr2B2YY70Luqlu413LPXV6eX1ZtmrN8C0Oz-eA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED9tK0LbA98TGQMMQoiXSlnir0i8lJW0iFJNW6vuzbIdm01D2ZStE38-vjQJnQQSEm9RfEmcO599v-T8O4B31lOWZT7uW2aSPi3SuK8TrKEhKBXaa5f6VbEJMZ3K09PsaAM-tnthVvwQ3Qc39Ix6vkYHd1eFX_Ny-90jN4KUm9ALD-TBLXvD43w--b0vUnDWcnsja0zDLISZPN3Fd9ajzTPMhuyhgn_eCTnXA9d65ckf_l-fH8GDJuIkg9UQeQwbrnwCO2s8hE-BLzSmBiBOJycWZz-C207IvDK6JJPz4eCY6LIgWOFIV-RkWXnM5HoG8_zz7HDcbwoqBEuIgBYN9VSbzOuwTltjCl6wxCZOGmd0liD4s1rH1umwshWC8oDFYh9Ty431Bz7A7l3YKi9L9xyIzah2sWYmdZJaGW7KmU-FzKSRBZdxBB9atSrbsI1j0YsfqkUdQRWqVkUEbzvRqxXFxh-Fgm26diTFHg8mCs_VqCygotuDCN7XpuvEdHWBiWuCqcV0pGaL0YyPP31Tiwj2W9uqxmevAwhCOjUep2kEb7rm4G34C0WX7nKJMhi_ZYKx8IK1pf_eZXU4yuuDvX8XfQ33j4a5mnyZfn0B20ldegOTDfdh66Zaupdwz97enF9Xr5qh_gtdjP3z
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=Watertight+Scenes+from+Urban+LiDAR+and+Planar+Surfaces&rft.jtitle=Computer+graphics+forum&rft.au=van+Kreveld%2C+M&rft.au=van+Lankveld%2C+T&rft.au=Veltkamp%2C+R.+C&rft.date=2013-08-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=32&rft.issue=5&rft.spage=217&rft_id=info:doi/10.1111%2Fcgf.12188&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3048788491
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