O-Snap: Optimization-Based Snapping for Modeling Architecture

被引:82
作者
Arikan, Murat [1 ]
Schwaerzler, Michael [2 ]
Floery, Simon [1 ]
Wimmer, Michael [1 ]
Maierhofer, Stefan [2 ]
机构
[1] Vienna Univ Technol, Inst Comp Graph & Algorithms, A-1040 Vienna, Austria
[2] VRVis Res Ctr, A-1220 Vienna, Austria
来源
ACM TRANSACTIONS ON GRAPHICS | 2013年 / 32卷 / 01期
关键词
Algorithms; Surface reconstruction; geometric optimization; interactive modeling; RECONSTRUCTION;
D O I
10.1145/2421636.2421642
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this article, we introduce a novel reconstruction and modeling pipeline to create polygonal models from unstructured point clouds. We propose an automatic polygonal reconstruction that can then be interactively refined by the user. An initial model is automatically created by extracting a set of RANSAC-based locally fitted planar primitives along with their boundary polygons, and then searching for local adjacency relations among parts of the polygons. The extracted set of adjacency relations is enforced to snap polygon elements together, while simultaneously fitting to the input point cloud and ensuring the planarity of the polygons. This optimization-based snapping algorithm may also be interleaved with user interaction. This allows the user to sketch modifications with coarse and loose 2D strokes, as the exact alignment of the polygons is automatically performed by the snapping. The generated models are coarse, offer simple editing possibilities by design, and are suitable for interactive 3D applications like games, virtual environments, etc. The main innovation in our approach lies in the tight coupling between interactive input and automatic optimization, as well as in an algorithm that robustly discovers the set of adjacency relations.
引用
收藏
页数:15
相关论文
共 41 条
[11]   l1-Sparse Reconstruction of Sharp Point Set Surfaces [J].
Avron, Haim ;
Sharf, Andrei ;
Greif, Chen ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2010, 29 (05)
[12]   Provably good sampling and meshing of surfaces [J].
Boissonnat, JD ;
Oudot, S .
GRAPHICAL MODELS, 2005, 67 (05) :405-451
[13]  
Cazals F., 2005, Point-Based Graphics 2005 (IEEE Cat. No. 05EX1159), P55, DOI 10.1109/PBG.2005.194064
[14]   Architectural modeling from sparsely scanned range data [J].
Chen, Jie ;
Chen, Baoquan .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2008, 78 (2-3) :223-236
[15]   Variational shape approximation [J].
Cohen-Steiner, D ;
Alliez, P ;
Desbrun, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :905-914
[16]   Algorithm 915, SuiteSparseQR: Multifrontal Multithreaded Rank-Revealing Sparse QR Factorization [J].
Davis, Timothy A. .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2011, 38 (01)
[17]  
Debevec P. E., 1996, Computer Graphics Proceedings. SIGGRAPH '96, P11, DOI 10.1145/237170.237191
[18]  
Demaine ED, 2008, GEOMETRIC FOLDING AL
[19]   3-DIMENSIONAL ALPHA-SHAPES [J].
EDELSBRUNNER, H ;
MUCKE, EP .
ACM TRANSACTIONS ON GRAPHICS, 1994, 13 (01) :43-72
[20]   Robust moving least-squares fitting with sharp features [J].
Fleishman, S ;
Cohen-Or, D ;
Silva, CT .
ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (03) :544-552