Piecewise-Planar 3D Reconstruction with Edge and Corner Regularization

This paper presents a method for the 3D reconstruction of a piecewise‐planar surface from range images, typically laser scans with millions of points. The reconstructed surface is a watertight polygonal mesh that conforms to observations at a given scale in the visible planar parts of the scene, and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer graphics forum Jg. 33; H. 5; S. 55 - 64
Hauptverfasser: Boulch, Alexandre, de La Gorce, Martin, Marlet, Renaud
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.08.2014
Wiley
Schlagworte:
ISSN:0167-7055, 1467-8659
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper presents a method for the 3D reconstruction of a piecewise‐planar surface from range images, typically laser scans with millions of points. The reconstructed surface is a watertight polygonal mesh that conforms to observations at a given scale in the visible planar parts of the scene, and that is plausible in hidden parts. We formulate surface reconstruction as a discrete optimization problem based on detected and hypothesized planes. One of our major contributions, besides a treatment of data anisotropy and novel surface hypotheses, is a regularization of the reconstructed surface w.r.t. the length of edges and the number of corners. Compared to classical area‐based regularization, it better captures surface complexity and is therefore better suited for man‐made environments, such as buildings. To handle the underlying higher‐order potentials, that are problematic for MRF optimizers, we formulate minimization as a sparse mixed‐integer linear programming problem and obtain an approximate solution using a simple relaxation. Experiments show that it is fast and reaches near‐optimal solutions.
AbstractList This paper presents a method for the 3D reconstruction of a piecewise-planar surface from range images, typically laser scans with millions of points. The reconstructed surface is a watertight polygonal mesh that conforms to observations at a given scale in the visible planar parts of the scene, and that is plausible in hidden parts. We formulate surface reconstruction as a discrete optimization problem based on detected and hypothesized planes. One of our major contributions, besides a treatment of data anisotropy and novel surface hypotheses, is a regularization of the reconstructed surface w.r.t. the length of edges and the number of corners. Compared to classical area-based regularization, it better captures surface complexity and is therefore better suited for man-made environments, such as buildings. To handle the underlying higher-order potentials, that are problematic for MRF optimizers, we formulate minimization as a sparse mixed-integer linear programming problem and obtain an approximate solution using a simple relaxation. Experiments show that it is fast and reaches near-optimal solutions. [PUBLICATION ABSTRACT]
This paper presents a method for the 3D reconstruction of a piecewise‐planar surface from range images, typically laser scans with millions of points. The reconstructed surface is a watertight polygonal mesh that conforms to observations at a given scale in the visible planar parts of the scene, and that is plausible in hidden parts. We formulate surface reconstruction as a discrete optimization problem based on detected and hypothesized planes. One of our major contributions, besides a treatment of data anisotropy and novel surface hypotheses, is a regularization of the reconstructed surface w.r.t. the length of edges and the number of corners. Compared to classical area‐based regularization, it better captures surface complexity and is therefore better suited for man‐made environments, such as buildings. To handle the underlying higher‐order potentials, that are problematic for MRF optimizers, we formulate minimization as a sparse mixed‐integer linear programming problem and obtain an approximate solution using a simple relaxation. Experiments show that it is fast and reaches near‐optimal solutions.
This paper presents a method for the 3D reconstruction of a piecewise-planar surface from range images, typi-cally laser scans with millions of points. The reconstructed surface is a watertight polygonal mesh that conforms to observations at a given scale in the visible planar parts of the scene, and that is plausible in hidden parts. We formulate surface reconstruction as a discrete optimization problem based on detected and hypothesized planes. One of our major contributions, besides a treatment of data anisotropy and novel surface hypotheses, is a regu-larization of the reconstructed surface w.r.t. the length of edges and the number of corners. Compared to classical area-based regularization, it better captures surface complexity and is therefore better suited for man-made en-vironments, such as buildings. To handle the underlying higher-order potentials, that are problematic for MRF optimizers, we formulate minimization as a sparse mixed-integer linear programming problem and obtain an ap-proximate solution using a simple relaxation. Experiments show that it is fast and reaches near-optimal solutions.
Author Boulch, Alexandre
de La Gorce, Martin
Marlet, Renaud
Author_xml – sequence: 1
  givenname: Alexandre
  surname: Boulch
  fullname: Boulch, Alexandre
  organization: Université Paris-Est, LIGM (UMR CNRS 8049), ENPC, F-77455 Marne-la-Vallée
– sequence: 2
  givenname: Martin
  surname: de La Gorce
  fullname: de La Gorce, Martin
  organization: Université Paris-Est, LIGM (UMR CNRS 8049), ENPC, F-77455 Marne-la-Vallée
– sequence: 3
  givenname: Renaud
  surname: Marlet
  fullname: Marlet, Renaud
  organization: Université Paris-Est, LIGM (UMR CNRS 8049), ENPC, F-77455 Marne-la-Vallée
BackLink https://enpc.hal.science/hal-01099280$$DView record in HAL
BookMark eNp1kUFP3DAQhS1EpS60h_6DSFzgEJiJ7Tg-wsLuVlq1tGpVqRfLcZzFNMRgJyzw60lYoFJF5-KR9b2neXo7ZLv1rSXkE8IhDnNkVvUhZoziFpkgy0Va5FxukwngsAvg_D3ZifESAJjI-YTMzp01du2iTc8b3eqQ0NPkuzW-jV3oTed8m6xdd5GcVSub6LZKpj60NgzMqm90cA96ZD6Qd7Vuov34_O6Sn7OzH9NFuvw6_zw9XqaGiQxTixmtpKl5qZnWDA2nJWOsLLAqyhw1cFmZTEpW2JpTk2koIecgKEgDpZV0lxxsfC90o66Du9LhXnnt1OJ4qcY_QJAyK-AWB3Z_w14Hf9Pb2KkrF41thpjW91GhEAVQzsVou_cPeun70A5JFHLOGWTIRupoQ5ngYwy2VsZ1T_G7oF2jENTYgRo6UE8d_D33VfFy81vss_vaNfb-_6CazmcvinSjcLGzd68KHf6oXFDB1a8vc5XhfHH6-9tCndBH7CykGA
CitedBy_id crossref_primary_10_1016_j_cviu_2016_06_004
crossref_primary_10_3390_app7101030
crossref_primary_10_3390_rs14020289
crossref_primary_10_1109_TVCG_2022_3230369
crossref_primary_10_1007_s11263_024_02059_x
crossref_primary_10_1016_j_cag_2017_11_010
crossref_primary_10_1111_cgf_14021
crossref_primary_10_3390_rs11192262
crossref_primary_10_1111_cgf_14364
crossref_primary_10_1111_cgf_12802
crossref_primary_10_1111_cgf_14421
crossref_primary_10_1111_cgf_13015
crossref_primary_10_1111_cgf_12983
crossref_primary_10_3390_rs10111754
crossref_primary_10_1080_01431161_2024_2365815
crossref_primary_10_1111_phor_12438
crossref_primary_10_1111_cgf_12531
crossref_primary_10_1016_j_isprsjprs_2021_06_007
crossref_primary_10_1109_TVCG_2019_2960776
crossref_primary_10_1145_2766995
crossref_primary_10_1016_j_isprsjprs_2022_09_017
crossref_primary_10_1109_JSTARS_2019_2918937
crossref_primary_10_1109_LGRS_2021_3113662
Cites_doi 10.1109/CVPR.2010.5539824
10.1109/CVPR.2013.175
10.1109/CVPR.2009.5206867
10.1109/TVCG.2012.30
10.1109/IROS.2008.4650729
10.1109/ICPR.2014.171
10.1109/ICCV.2009.5459209
10.1111/j.1467-8659.2012.03181.x
10.1007/s00371-012-0749-1
10.1109/TPAMI.2004.1262177
10.1111/j.1467-8659.2009.01389.x
10.1111/j.1467-8659.2007.01016.x
10.1111/cgf.12042
10.1111/cgf.12170
10.1007/978-3-642-23094-3_15
10.1007/s11263-007-0105-5
10.1145/1964921.1964947
10.1111/cgf.12188
ContentType Journal Article
Copyright 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
2014 The Eurographics Association and John Wiley & Sons Ltd.
Copyright
Copyright_xml – notice: 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
– notice: 2014 The Eurographics Association and John Wiley & Sons Ltd.
– notice: Copyright
DBID BSCLL
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
1XC
VOOES
DOI 10.1111/cgf.12431
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
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
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Computer and Information Systems Abstracts
CrossRef


Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1467-8659
EndPage 64
ExternalDocumentID oai:HAL:hal-01099280v1
3410909821
10_1111_cgf_12431
CGF12431
ark_67375_WNG_21GHDZQH_B
Genre article
Feature
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
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
AAHHS
ACCFJ
ADZOD
AEEZP
AEQDE
AEUQT
AFPWT
AIWBW
AJBDE
ALUQN
WRC
AAYXX
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
F28
FR3
1XC
VOOES
ID FETCH-LOGICAL-c4721-e123d9cf5ba4aa41c53b444b81d8b61a059dc29948ef53c2a0b06507309c0be93
IEDL.DBID DRFUL
ISICitedReferencesCount 45
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000341128900006&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:52:10 EDT 2025
Sun Nov 23 09:44:49 EST 2025
Mon Jul 14 08:11:54 EDT 2025
Tue Nov 18 22:46:20 EST 2025
Sat Nov 29 08:02:00 EST 2025
Wed Jan 22 16:25:45 EST 2025
Tue Nov 11 03:32:53 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License Copyright: http://hal.archives-ouvertes.fr/licences/copyright
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c4721-e123d9cf5ba4aa41c53b444b81d8b61a059dc29948ef53c2a0b06507309c0be93
Notes istex:06A479C05F3BCD262C4BD0DA344814633A163223
ArticleID:CGF12431
ark:/67375/WNG-21GHDZQH-B
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0002-4196-9665
0000-0003-1612-1758
OpenAccessLink https://enpc.hal.science/hal-01099280
PQID 1555402149
PQPubID 30877
PageCount 10
ParticipantIDs hal_primary_oai_HAL_hal_01099280v1
proquest_miscellaneous_1778035579
proquest_journals_1555402149
crossref_citationtrail_10_1111_cgf_12431
crossref_primary_10_1111_cgf_12431
wiley_primary_10_1111_cgf_12431_CGF12431
istex_primary_ark_67375_WNG_21GHDZQH_B
PublicationCentury 2000
PublicationDate August 2014
PublicationDateYYYYMMDD 2014-08-01
PublicationDate_xml – month: 08
  year: 2014
  text: August 2014
PublicationDecade 2010
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle Computer graphics forum
PublicationTitleAlternate Computer Graphics Forum
PublicationYear 2014
Publisher Blackwell Publishing Ltd
Wiley
Publisher_xml – name: Blackwell Publishing Ltd
– name: Wiley
References Paulsen R.R., Baerentzen J.A., Larsen R.: Markov random field surface reconstruction. TVCG 16 (2010). 2
Fayolle P.-A., Pasko A.: Segmentation of discrete point clouds using an extensible set of templates. Vis. Comput. 29, 5 (2013), 449-465. 2
Shekhovtsov A., Kohli P., Rother C.: Curvature prior for MRF-based segmentation and shape inpainting. In DAGM/OAGM Symposium (2012), vol. 7476 of LNCS. 2
2013; 29
2010; 16
2012
2012; 7476
2011
2010
2009
2008
2007
2004
2014
2013
2002
e_1_2_7_5_2
e_1_2_7_4_2
e_1_2_7_3_2
e_1_2_7_2_2
e_1_2_7_9_2
e_1_2_7_8_2
e_1_2_7_7_2
e_1_2_7_6_2
e_1_2_7_18_2
e_1_2_7_17_2
e_1_2_7_16_2
Shekhovtsov A. (e_1_2_7_24_2) 2012; 7476
e_1_2_7_15_2
e_1_2_7_14_2
e_1_2_7_13_2
e_1_2_7_12_2
e_1_2_7_11_2
e_1_2_7_10_2
e_1_2_7_26_2
e_1_2_7_27_2
e_1_2_7_25_2
e_1_2_7_23_2
Paulsen R.R. (e_1_2_7_19_2) 2010; 16
e_1_2_7_22_2
e_1_2_7_21_2
e_1_2_7_20_2
References_xml – reference: Fayolle P.-A., Pasko A.: Segmentation of discrete point clouds using an extensible set of templates. Vis. Comput. 29, 5 (2013), 449-465. 2
– reference: Paulsen R.R., Baerentzen J.A., Larsen R.: Markov random field surface reconstruction. TVCG 16 (2010). 2
– reference: Shekhovtsov A., Kohli P., Rother C.: Curvature prior for MRF-based segmentation and shape inpainting. In DAGM/OAGM Symposium (2012), vol. 7476 of LNCS. 2
– year: 2011
– year: 2009
– start-page: 205
  year: 2011
  end-page: 218
– volume: 16
  year: 2010
  article-title: Markov random field surface reconstruction
  publication-title: TVCG
– volume: 29
  start-page: 449
  issue: 5
  year: 2013
  end-page: 465
  article-title: Segmentation of discrete point clouds using an extensible set of templates
  publication-title: Vis. Comput
– year: 2002
– year: 2008
– year: 2007
– year: 2004
– start-page: 217
  year: 2013
  end-page: 228
– volume: 7476
  year: 2012
  article-title: Curvature prior for MRF‐based segmentation and shape inpainting. In DAGM/OAGM Symposium
  publication-title: LNCS
– start-page: 1261
  year: 2010
  end-page: 1268
– start-page: 3378
  year: 2008
  end-page: 3383
– start-page: 80
  year: 2009
  end-page: 87
– year: 2014
– year: 2010
– year: 2013
– year: 2012
– ident: e_1_2_7_10_2
  doi: 10.1109/CVPR.2010.5539824
– ident: e_1_2_7_2_2
– ident: e_1_2_7_15_2
  doi: 10.1109/CVPR.2013.175
– ident: e_1_2_7_8_2
– ident: e_1_2_7_11_2
  doi: 10.1109/CVPR.2009.5206867
– ident: e_1_2_7_26_2
  doi: 10.1109/TVCG.2012.30
– ident: e_1_2_7_20_2
  doi: 10.1109/IROS.2008.4650729
– ident: e_1_2_7_6_2
  doi: 10.1109/ICPR.2014.171
– volume: 16
  year: 2010
  ident: e_1_2_7_19_2
  article-title: Markov random field surface reconstruction
  publication-title: TVCG
– ident: e_1_2_7_23_2
  doi: 10.1109/ICCV.2009.5459209
– ident: e_1_2_7_12_2
– ident: e_1_2_7_5_2
  doi: 10.1111/j.1467-8659.2012.03181.x
– ident: e_1_2_7_13_2
  doi: 10.1007/s00371-012-0749-1
– ident: e_1_2_7_16_2
  doi: 10.1109/TPAMI.2004.1262177
– volume: 7476
  year: 2012
  ident: e_1_2_7_24_2
  article-title: Curvature prior for MRF‐based segmentation and shape inpainting. In DAGM/OAGM Symposium
  publication-title: LNCS
– ident: e_1_2_7_21_2
  doi: 10.1111/j.1467-8659.2009.01389.x
– ident: e_1_2_7_14_2
– ident: e_1_2_7_3_2
– ident: e_1_2_7_25_2
  doi: 10.1111/j.1467-8659.2007.01016.x
– ident: e_1_2_7_17_2
  doi: 10.1111/cgf.12042
– ident: e_1_2_7_4_2
  doi: 10.1111/cgf.12170
– ident: e_1_2_7_22_2
  doi: 10.1007/978-3-642-23094-3_15
– ident: e_1_2_7_9_2
  doi: 10.1007/s11263-007-0105-5
– ident: e_1_2_7_18_2
  doi: 10.1145/1964921.1964947
– ident: e_1_2_7_7_2
– ident: e_1_2_7_27_2
  doi: 10.1111/cgf.12188
SSID ssj0004765
Score 2.3351161
Snippet This paper presents a method for the 3D reconstruction of a piecewise‐planar surface from range images, typically laser scans with millions of points. The...
This paper presents a method for the 3D reconstruction of a piecewise-planar surface from range images, typically laser scans with millions of points. The...
This paper presents a method for the 3D reconstruction of a piecewise-planar surface from range images, typi-cally laser scans with millions of points. The...
SourceID hal
proquest
crossref
wiley
istex
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 55
SubjectTerms 3-D graphics
Analysis
Anisotropy
Categories and Subject Descriptors (according to ACM CCS)
Computational Geometry
Computer Science
Computer Vision and Pattern Recognition
Corners
I.2.10 [Artificial Intelligence]: Vision and Scene Understanding-3D/stereo scene analysis
I.4.8 [Image Processing and Computer Vision]: Scene Analysis-Range data
I.5.4 [Pattern Recognition]: Applications-Computer vision
Linear programming
Magnetorheological fluids
Mathematical models
Optimization
Polygons
Reconstruction
Regularization
Regularization methods
Studies
Three dimensional
Topological manifolds
Title Piecewise-Planar 3D Reconstruction with Edge and Corner Regularization
URI https://api.istex.fr/ark:/67375/WNG-21GHDZQH-B/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12431
https://www.proquest.com/docview/1555402149
https://www.proquest.com/docview/1778035579
https://enpc.hal.science/hal-01099280
Volume 33
WOSCitedRecordID wos000341128900006&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 Full Collection 2020
  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/eLvHCXMwpV3NTttAEB5B0gMcCpQiUn7koqri4iqxd-O1eoKExAcUASoq4rJar8cQgRzkAO2RR-gz9kk649gmSFSq1Jtlj6XVzszOt7sz3wB8kgmXe4aJa7ErXWEkusZX1lUqiTGwiejatGg2EYxG6uIiPFmAr1UtzIwfoj5wY88o1mt2cBNP55zcXqVfKDhxDXXTI7uVDWj2zwbnx89lkUFXVtTeTBpTEgtxIk_984twtHjNyZBNnt-fLxDnPG4tAs9g5b-GvApvS7zpHMwMZA0WMHsHy3MshOsQnYzR4o_xFH8__eImRiZ3_L7DG9NnelmHD2ydo-QKHZMlTm-SZ5iTDHeyz8tazvdwPjj61ovcssGCawXt_FyksJWENpWxEcaIjpV-LISICcOquNsxBL0SS_FKKEylbz3TjhnR0aIQ2naMob8BjWyS4SY4gqAcytASHjIU9JVB0rVqmzAN0HqeacF-Nc_aluzj3ATjVle7EJocXUxOC_Zq0bsZ5carQqSs-juTZEcHx5rfFZd9nmo_ktDnQpe1mMlvOJEtkPr7aKi9zjDqX55G-rAF25WydenDU01Ii-CsR1vIFnysP5P38ZWKyXDyQDJBoMj0ZEAy-4Xq_z5k3RsOiocP_y66BUuE0MQs43AbGqR03IE39vF-PM13S4P_AwLBAbo
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9NAEB6VBgk4UB5FDX1gEEK9uHLs3XgtcWmTJkaEqKBWVL2s1utxG4Ec5NDHkZ_Ab-wv6Yxju6kEEhI3yx5Lq52ZnW93Z74BeCtTLveMUtdiV7rCSHRNoKyrVJpgaFPRtVnZbCIcj9XxcXSwBO_rWpg5P0Rz4MaeUa7X7OB8IL3g5fY026HoxEXULUFmRPbd6n8ZHI1u6yLDrqy5vZk1pmIW4kye5uc78ejeGWdDtniCr-5AzkXgWkaewcr_jfkJPK4Qp7M7N5GnsIT5M3i0wEP4HOKDCVq8nMzw-tdvbmNkCifoO7w1vSWYdfjI1tlPT9Exeer0pkWOBclwL_uiquZchaPB_mEvdqsWC64VtPdzkQJXGtlMJkYYIzpWBokQIiEUq5JuxxD4Si1FLKEwk4H1jZcwpqNlIbJeglHwApbzaY5r4AgCcygjS4jIUNhXBknbyjNRFqL1fdOG7Xqita34x7kNxndd70NocnQ5OW1404j-mJNu_FGItNV8Z5rseHek-V153ecr74KE3pXKbMRM8Y1T2UKpv46H2u8M4_7J51jvtWGj1rauvHimCWsRoPVpE9mG181n8j--VDE5Ts9JJgyVR6AtJJntUvd_H7LuDQflw8t_F30FD-LDTyM9-jD-uA4PCa-Jef7hBiyTAeAm3LcXPyezYquy_htxWQWq
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1fi9NAEB_OVkQf_C9WT40ici-RNNltNuDL2V4asZQqHh6-LJvdyVmU9Ej19NGP4Gf0kziTJrkeKAi-hWQCy87Ozm92Z34D8FQ6LvdMnG9xJH1hJPomUtZXyuUYWydGtqibTcTzuTo6ShY78KKthdnwQ3QHbmwZ9X7NBo4nrtiycntcPCfvxEXUfcFNZHrQn7xND2dndZHxSLbc3swa0zALcSZP9_M5f3ThI2dD9nmCv5-DnNvAtfY86bX_G_N1uNogTm9_s0RuwA6WN-HKFg_hLcgWS7T4bbnGXz9-chsjU3nRxOPQ9Ixg1uMjW-_AHaNnSueNV1WJFclwL_uqqea8DYfpwbtx5jctFnwrKPbzkRyXS2whcyOMEUMro1wIkROKVfloaAh8OUseSygsZGRDE-SM6WhbSGyQYxLdgV65KvEueILAHMrEEiIy5PaVQdK2CkxSxGjD0Axgr51obRv-cW6D8Vm3cQhNjq4nZwBPOtGTDenGH4VIW913psnO9mea39XXfaEKTknoWa3MTsxUnziVLZb6_Xyqw-E0m3x4k-mXA9htta0bK15rwloEaEMKIgfwuPtM9seXKqbE1VeSiWMVEGiLSWav1v3fh6zH07R-uPfvoo_g0mKS6tmr-ev7cJngmtikH-5Cj_SPD-CiPf2yXFcPm8X_G_PmBSU
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=Piecewise%E2%80%90Planar+3D+Reconstruction+with+Edge+and+Corner+Regularization&rft.jtitle=Computer+graphics+forum&rft.au=Boulch%2C+Alexandre&rft.au=de+La+Gorce%2C+Martin&rft.au=Marlet%2C+Renaud&rft.date=2014-08-01&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=33&rft.issue=5&rft.spage=55&rft.epage=64&rft_id=info:doi/10.1111%2Fcgf.12431&rft.externalDBID=n%2Fa&rft.externalDocID=10_1111_cgf_12431
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