TY - GEN
T1 - PolyFit: Polygonal Surface Reconstruction from Point Clouds
AU - Nan, Liangliang
AU - Wonka, Peter
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): OCRF-2014-CGR3-62140401
Acknowledgements: This research was supported by the KAUST Office of Sponsored Research (award No. OCRF-2014-CGR3-62140401) and the Visual Computing Center (VCC) at KAUST.
PY - 2017/12/25
Y1 - 2017/12/25
N2 - We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.
AB - We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.
UR - http://hdl.handle.net/10754/627151
UR - http://ieeexplore.ieee.org/document/8237520/
UR - http://www.scopus.com/inward/record.url?scp=85041897661&partnerID=8YFLogxK
U2 - 10.1109/ICCV.2017.258
DO - 10.1109/ICCV.2017.258
M3 - Conference contribution
SN - 9781538610329
SP - 2372
EP - 2380
BT - 2017 IEEE International Conference on Computer Vision (ICCV)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -