#### DMCA

## State of the Art in Surface Reconstruction from Point Clouds (2014)

Venue: | IN PROC. EUROGRAPHICS 2014 |

Citations: | 9 - 1 self |

### Citations

2686 | Marching Cubes: A High Resolution 3D Surface Construction Algorithm
- Lorensen, Cline
- 1987
(Show Context)
Citation Context ...Implicit functions are usually sampled on an underlying grid, where the reconstructed surface is found via isocontouring for an appropriate isovalue. For a regular grid, the well-known Marching Cubes =-=[LC87]-=- is commonly used to extract the surface [HDD∗92,CL96,CBC∗01,Kaz05]. Other methods use grids such as octrees [KBH06,MPS08] or adaptive 3D triangulations [ACSTD07, MDGD∗10] to adapt grid resolution to ... |

1018 | A volumetric method for building complex models from range images
- Curless, Levoy
- 1996
(Show Context)
Citation Context ... general implicit field Graph Cut [HK06] # # # # # general volumetric segmentation Unoriented Indicator [ACSTD07] #s# # # ✓ general implicit field LOP [LCOLTE07]s# # general point set Visibility VRIP =-=[CL96]-=- #s# ✓ general implicit field TVL1-VRIP [ZPB07] #s# # # ✓ general implicit field Signing the Unsigned [MDGD∗10] #s# ✓ general implicit field Cone Carving [SSZCO10] # #s✓ ✓ general implicit field Multi... |

505 |
Poisson image editing
- Perez, Gangnet, et al.
- 2003
(Show Context)
Citation Context ...anner. Indicator function methods are an instance of gradientdomain techniques, which are known to be robust methods for such applications as high dynamic range compression [FLW02] and image blending =-=[PGB03]-=-. For surface reconstruction, such a gradient-domain formulation results in robustness to nonuniform sampling, noise, outliers, and to a certain extent missing data. The implicit function’s gradient b... |

503 | Reconstruction and representation of 3d objects with radial basis functions - Carr, Beatson, et al. - 2001 |

402 | M.: Surface reconstruction by Voronoi filtering. Discrete and Computational Geometry 22
- AMENTA, BERN
- 1999
(Show Context)
Citation Context ...itions, limiting its effectiveness with undersampling and missing data. Conditions on sampling are relaxed in [CLCL11] where inconsistencies are detected by observing that if one point’s Voronoi pole =-=[AB99]-=- lies in the exterior, the other Voronoi pole should be in the interior. If both are occluded or visible via [KTB07], this indicates an inconsistency. Unfortunately, since the method uses Voronoi pole... |

368 | Poisson surface reconstruction”,
- Kazhdan, Bolitho, et al.
- 2006
(Show Context)
Citation Context ...face Smoothness Tangent Planes [HDD∗92] # # general implicit field RBF [CBC∗01] # # ✓ general implicit field MLS [ABCO∗03] # # ✓ general point set MPU [OBA∗03a] # # # ✓ general implicit field Poisson =-=[KBH06]-=- #s# # # ✓ general implicit field Graph Cut [HK06] # # # # # general volumetric segmentation Unoriented Indicator [ACSTD07] #s# # # ✓ general implicit field LOP [LCOLTE07]s# # general point set Visibi... |

278 | Kinectfusion: Real-time dense surface mapping and tracking - Newcombe, Izadi, et al. - 2011 |

258 | Dual Contouring of Hermite Data - Ju, Losasso, et al. - 2002 |

216 | Multi-level partition of unity implicits - Ohtake, Belyaev, et al. - 2003 |

185 | A review of vessel extraction techniques and algorithms.
- Kirbas, Quek
- 2004
(Show Context)
Citation Context ... Organic skeletal geometry. Tubular components exhibiting piecewise smooth radii variations are also suitable to model organic and natural geometry like trees [RFL∗05, NFD07, LYO∗10] or blood vessels =-=[KQ04]-=-. In tree reconstruction, biological constraints are exploited to simplify the problem and increase resiliency to data imperfections. Noise is introduced by foliage, as this is typically too small to ... |

178 | Y.: Defining point-set surfaces - AMENTA, KIL |

145 |
Robust moving least-squares fitting with sharp features
- Fleishman, Silva, et al.
- 2005
(Show Context)
Citation Context ...similar normals. Sharp and robust.Only few approaches tackle the combined issue of robustness to defect-laden point clouds and featurepreserving reconstruction [FCOS05a,ASGCO10,HWG∗13]. The method of =-=[FCOS05a]-=- uses a least median of squares regression scheme in its region growing approach to handle outliers in the data. The approach of [ASGCO10] first estimates normals that preserve sharp features in the s... |

138 | Multi-scale feature extraction on point-sampled models
- PAULY, KEISER, et al.
- 2003
(Show Context)
Citation Context ... edges, much like general feature detection approaches [GWM01,PP09]. Globally-sharp features. To reduce crease fragmentation, some approaches favor the extraction of long sharp features. Pauly et al. =-=[PKG03]-=- use a multi-scale approach to detect feature points and construct a minimum-spanning tree to infer a feature graph. Daniels et al. [DHOS07] uses a robust projection operator onto sharp creases and gr... |

127 | Elberink SO: Accuracy and Resolution of Kinect Depth Data for Indoor Mapping Applications - Khoshelham |

117 | Estimating differential quantities using polynomial fitting of osculating jets
- CAZALS, POUGET
- 2003
(Show Context)
Citation Context ...st-squares estimation of a tangent plane and there are many other methods for computing unoriented normals: using a weighted covariance matrix [PMG04], higher-order approximations via osculating jets =-=[CP05]-=-, or robust methods that employ l1 norm minimization [ASGCO10]. Common to all methods is the need to define a local neighborhood of points, where the neighborhood should be small enough to accurately ... |

106 | STUETZLE W.: Surface reconstruction from unorganized points - HOPPE, DEROSE, et al. - 1992 |

106 | Discovering structural regularity in 3d geometry - Pauly, Mitra, et al. - 2011 |

89 |
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis,
- Dey
- 2007
(Show Context)
Citation Context ...ods is that the reconstructed triangulated surface is formed by a subcomplex of the Delaunay triangulation. A comprehensive survey of these methods is presented in [CG06], as well as the monograph of =-=[Dey07]-=-. A very attractive aspect of such methods is that they come with provable guarantees in the geometric and sometimes topological quality of the reconstruction if a sufficiently dense sampling of the i... |

85 | Example-based 3d scan completion. In - Pauly, Mitra, et al. - 2005 |

81 | Spectral surface reconstruction from noisy point clouds
- Kolluri, Shewchuk, et al.
- 2004
(Show Context)
Citation Context ...mentation. These methods perform reconstruction via a hard labeling of a volumetric discretization, where the goal is to label cells as being either interior or exterior to the surface. The method of =-=[KSO04]-=- constructs a graph Laplacian from the Delaunay triangulation of P, where each node represents a tetrahedron of the triangulation and each edge measures the likelihood of the surface passing through t... |

80 | Algebraic point set surfaces
- Guennebaud, Gross
(Show Context)
Citation Context ...thermore, noise and misalignment may necessitate larger neighborhood sizes in order to combat such imperfections, yet the size should not be so large as to no longer reflect the point’s tangent space =-=[GG07]-=-. All of these difficulties often result in imperfect normal estimation and surface reconstruction algorithms must be robust to inaccuracies in unoriented normals. Oriented normals. Normals that have ... |

71 | Feature extraction from point clouds - GUMHOLD, WANG, et al. - 2001 |

68 | Delaunay Triangulation based Surface Reconstruction: Ideas and Algorithms
- Cazals, Giesen
- 2004
(Show Context)
Citation Context ...ea. The basic idea behind these methods is that the reconstructed triangulated surface is formed by a subcomplex of the Delaunay triangulation. A comprehensive survey of these methods is presented in =-=[CG06]-=-, as well as the monograph of [Dey07]. A very attractive aspect of such methods is that they come with provable guarantees in the geometric and sometimes topological quality of the reconstruction if a... |

62 | Voronoi-based variational reconstruction of unoriented point sets
- Alliez, Cohen-Steiner, et al.
- 2007
(Show Context)
Citation Context ...] # # ✓ general point set MPU [OBA∗03a] # # # ✓ general implicit field Poisson [KBH06] #s# # # ✓ general implicit field Graph Cut [HK06] # # # # # general volumetric segmentation Unoriented Indicator =-=[ACSTD07]-=- #s# # # ✓ general implicit field LOP [LCOLTE07]s# # general point set Visibility VRIP [CL96] #s# ✓ general implicit field TVL1-VRIP [ZPB07] #s# # # ✓ general implicit field Signing the Unsigned [MDGD... |

60 | On normals and projection operators for surfaces defined by point sets
- Alexa, Adamson
- 2004
(Show Context)
Citation Context ... taken, however, when fronts merge and split. If normals are oriented, then one can simplify the MLS definition to arrive at an implicit function representation for the surface. Namely, the method of =-=[AA04]-=- constructs an implicit function at a point as the signed distance to a weighted average of nearby tangent planes. The method of [SOS04] uses a weighted average of distances to nearby tangent planes. ... |

59 | Model globally, match locally: Efficient and robust 3D object recognition.
- Drost, Ulrich, et al.
- 2010
(Show Context)
Citation Context ... can then be used for reconstruction. We note that although this method can detect a small set of easily parameterizable shapes, efficient pose detection methods for arbitrary shapes can also be used =-=[DUNI10]-=-. Figure 12: (left) CAD models are often obtained by constructive solid geometry as a composition of simple primitives: planes, spheres, cones, etc. (middle) Randomized search [SWK07] can be used to d... |

56 | Reconstructing surfaces using anisotropic basis functions
- Dinh, Slabaugh, et al.
- 2001
(Show Context)
Citation Context ...es. One step toward piecewise smoothness is a class of feature-preserving methods based on implicit representations. Sharp features can be captured through locally adapted anisotropic basis functions =-=[DTS01]-=-. Adamson and Alexa [AA06] rely on an anisotropic moving least squares (MLS) approach, where the anisotropy is based on principal curvatures derived from the points’ positions and normals. Oztireli et... |

55 | Feature preserving point set surfaces based on non-linear kernel regression. Computer Graphics Forum (Proc
- ÖZTIRELI, GUENNEBAUD, et al.
- 2009
(Show Context)
Citation Context ... is to produce a surface that passes near the points without overfitting to the noise. Robust algorithms that impose smoothness on the output [KBH06], as well as methods that employ robust statistics =-=[OGG09]-=-, are common ways of handling noise. We note that spatially varying noise poses a significant challenge [GCSA13], where for many scanners, the noise level is correlated with the depth measurement – se... |

53 |
Provably good sampling and meshing of surfaces,” Graph.
- Boissonnat, Oudot
- 2005
(Show Context)
Citation Context ...can be done via marching tetrahedra, but if a mesh with a lower number of triangles and well-conditioned (i.e. good aspect ratio) triangles is desired, then Delaunay refinement techniques may be used =-=[BO05]-=-. Some techniques may not produce a surface representation, but rather a resampled point set that addresses imperfections present in the original point cloud [ABCO∗03, FCOS05b, LCOLTE07, HLZ∗09]. For ... |

49 | Approximate image-based treemodeling using particle flows
- Neubert, Franken, et al.
- 2007
(Show Context)
Citation Context ...ages have been shown sufficient to c© Author version Berger et al. / State of the Art in Surface Reconstruction from Point Clouds hallucinate the 3D information with the help of some user interaction =-=[NFD07]-=-, recent research has attempted to model the tree structure directly from 3D point clouds [LYO∗10]. Generalized volumetric smoothness. Several methods exist for imposing volumetric smoothness on the m... |

49 | H.-P.: Multi-level partition of unity implicits - OHTAKE, BELYAEV, et al. |

47 | Provenance for computational tasks: a survey”, in: - Freire, Koop, et al. - 2008 |

47 | Consolidation of unorganized point clouds for surface reconstruction - Huang, Li, et al. |

47 |
Reconstruction of solid models from oriented point sets
- Kazhdan
- 2005
(Show Context)
Citation Context ...onstruction generally produce as output either a discrete surface or an implicit function. The implicit function can either be in the form of a signed distance field [HDD∗92] or an indicator function =-=[Kaz05]-=-. Implicit functions are usually sampled on an underlying grid, where the reconstructed surface is found via isocontouring for an appropriate isovalue. For a regular grid, the well-known Marching Cube... |

47 | Global optimization for shape fitting
- Lempitsky, Boykov
(Show Context)
Citation Context ... encourage smoothness in regions of missing data, while using line-of-sight as a datafitting term. Existing approaches solve such a formulation via level-set models [Whi98] and graph cut optimization =-=[LB07]-=-. The method of [LPK09] seeks an interior and exterior labeling of tetrahedra from a Delaunay triangulation of the point cloud, similar to [KSO04], but formulates it as a graph cut problem using line ... |

46 | Robust reconstruction of watertight 3d models from non-uniformly sampled point clouds without normal information
- Hornung, Kobbelt
- 2006
(Show Context)
Citation Context ... implicit field RBF [CBC∗01] # # ✓ general implicit field MLS [ABCO∗03] # # ✓ general point set MPU [OBA∗03a] # # # ✓ general implicit field Poisson [KBH06] #s# # # ✓ general implicit field Graph Cut =-=[HK06]-=- # # # # # general volumetric segmentation Unoriented Indicator [ACSTD07] #s# # # ✓ general implicit field LOP [LCOLTE07]s# # general point set Visibility VRIP [CL96] #s# ✓ general implicit field TVL1... |

42 | Globfit: consistently fitting primitives by discovering global relations - Li, Wu, et al. - 2010 |

42 | Smartboxes for interactive urban reconstruction, - Nan, Sharf, et al. - 2010 |

41 | Acquiring 3d indoor environments with variability and repetition.
- Kim, Mitra, et al.
- 2012
(Show Context)
Citation Context ...[LWC∗11]s# #s✓ man-made primitive relations Data-driven Completion by Example [PMG∗05] # #s✓ general point set Semantic Modeling [SXZ∗12] # #s✓ ✓ indoor scene objects deformed model Shape Variability =-=[KMYG12]-=- # #s✓ indoor scene objects deformed model Part Composition [SFCH12] # #s✓ ✓ man-made deformed model parts Interactive Topological Scribble [SLS∗07] # #s✓ general implicit field Smartboxes [NSZ∗10]s# ... |

40 | Symmetry factored embedding and distance
- Lipman, Chen, et al.
- 2010
(Show Context)
Citation Context ...me prominent in this transformation space, hence repeating elements of varying levels of missing data can be robustly detected and used to reconstruct incomplete regions, see Figure 13. The method of =-=[LCDF10]-=- finds symmetries in incomplete point clouds by constructing an affinity matrix that measures how symmetric all pairs of points are. The key insight made by [LCDF10] is that this matrix should be bloc... |

40 | Modeling and visualization of leaf venation patterns,” - Runions, Fuhrer, et al. - 2005 |

38 | Parameterization-free projection for geometry reconstruction
- Lipman, Cohen-Or, et al.
(Show Context)
Citation Context ... general implicit field Poisson [KBH06] #s# # # ✓ general implicit field Graph Cut [HK06] # # # # # general volumetric segmentation Unoriented Indicator [ACSTD07] #s# # # ✓ general implicit field LOP =-=[LCOLTE07]-=-s# # general point set Visibility VRIP [CL96] #s# ✓ general implicit field TVL1-VRIP [ZPB07] #s# # # ✓ general implicit field Signing the Unsigned [MDGD∗10] #s# ✓ general implicit field Cone Carving [... |

36 | Screened poisson surface reconstruction. TOG
- Kazhdan, Hoppe
- 2013
(Show Context)
Citation Context ... gradient fit for the indicator function. Several extensions have been made to this original formulation, addressing limitations related to streaming reconstruction [MPS08], faithfulness to the input =-=[KH13]-=-, and sensitivity to normals [ACSTD07]. The work of [MPS08] solves the Poisson equation in a similar manner to [Kaz05], but rather than using a Fourier basis, it uses wavelets in such a way that compu... |

31 | Abstraction of man-made shapes - Mehra, Zhou, et al. - 2009 |

31 | A search-classify approach for cluttered indoor scene understanding
- Nan, Xie, et al.
(Show Context)
Citation Context ...typical office setting there exists a variety of chairs, desks, and tables. Furthermore, each type of object can often be defined through a low-dimensional shape space, permitting data-driven methods =-=[NXS12]-=- and methods that utilize a deformable model for each object [KMYG12] – see Figure 15. 2.4. Reconstruction Output It is desirable for a reconstruction algorithm to produce a faithful and detailed repr... |

30 | J.-P.: Robust piecewise-planar 3D reconstruction and completion from largescale unstructured point data
- CHAUVE, LABATUT, et al.
(Show Context)
Citation Context ...rimitive information. Although the method of [SDK09] can robustly handle missing data, it can be sensitive to noisy primitives which may fail to define a coherent model when extrapolated. The work of =-=[CLP10]-=- instead uses line of sight information to help penalize poorly extrapolated primitives. Namely, this work takes the set of primitives as well as an additional set of primitives formed near the bounda... |

30 | Purgathofer W.: A survey of urban reconstruction. - Musialski, Wonka, et al. - 2013 |

29 |
WERMAN M.: Gradient domain high dynamic range compression
- FATTAL, LISCHINSKI
(Show Context)
Citation Context ...coarse-to-fine resolution manner. Indicator function methods are an instance of gradientdomain techniques, which are known to be robust methods for such applications as high dynamic range compression =-=[FLW02]-=- and image blending [PGB03]. For surface reconstruction, such a gradient-domain formulation results in robustness to nonuniform sampling, noise, outliers, and to a certain extent missing data. The imp... |

29 | Surface reconstruction using local shape priors.Symposium on Geometry Processing, - Gal, Shamir, et al. - 2007 |

29 | Direct visibility of point sets.
- KATZ, TAL, et al.
- 2007
(Show Context)
Citation Context ...e as the regularization term. This type of regularization, commonly known as total variation denoising, allows the algorithm (a) (b) (c) Figure 8: The point cloud “hidden point removal” operator from =-=[KTB07]-=- applied to an input (a) determines the subset of visible points as viewed from a given viewpoint (b). Given this labeling, a view-dependent on-the-fly reconstruction (c) can be obtained by retaining ... |

29 |
Uncertainty and variability in point cloud surface data
- Pauly, Mitra, et al.
(Show Context)
Citation Context ...apture all of the variance in the data. PCA defines a least-squares estimation of a tangent plane and there are many other methods for computing unoriented normals: using a weighted covariance matrix =-=[PMG04]-=-, higher-order approximations via osculating jets [CP05], or robust methods that employ l1 norm minimization [ASGCO10]. Common to all methods is the need to define a local neighborhood of points, wher... |

26 | Unconstrained isosurface extraction on arbitrary octrees - Kazhdan, Klein, et al. - 2007 |

26 | D.: Datadependent MLS for faithful surface approximation
- Lipman, Cohen-Or, et al.
(Show Context)
Citation Context ...als [OBA∗03b]: the algorithm fits as many quadrics as the number of clusters of normals. Improved robustness is achieved in [FCOS05b] by segmenting neighborhoods through region growing. Lipman et al. =-=[LCOL07]-=- enriches the MLS projection framework with sharp edges driven by the local error of the MLS approximation. However, the locality of the feature detection can generate fragmented sharp edges, much lik... |

24 | 2D-3D Fusion for Layer Decomposition of Urban Façades - Li, Zheng, et al. - 2011 |

23 | ALLIEZ P.: Signing the unsigned: robust surface reconstruction from raw pointsets - MULLEN, GOES, et al. |

22 | Architectural modelling from sparsely scanned range data
- Chen, Chen
- 2008
(Show Context)
Citation Context ... reconstruction of models that can be assembled by simple polygonal primitives. The role of the user is to provide hints in how to improve the connectivity of the reconstructed model. The approach of =-=[CC08]-=- is focused on building reconstruction from incomplete scans. They first estimate planar polygons as well as their boundaries from the scans. Acknowledging that this estimation will be imperfect under... |

22 |
Taubin G. SSD: Smooth signed distance surface reconstruction. Comput Graph Forum 2011;30(7):1993–2002
- Calakli
(Show Context)
Citation Context ...H13, Fig. 4(a)]. To address this, the method of [KH13] directly uses the point cloud as positional constraints into the optimization, resulting in a screened Poisson problem. Similarly, the method of =-=[CT11]-=- incorporates positional, gradient, as well as Hessian constraints on the implicit function, where the Hessian constraint can improve surface extrapolation in regions of missing data [KH13, Fig. 6(a)]... |

22 |
Streaming surface reconstruction using wavelets
- Manson, Petrova, et al.
(Show Context)
Citation Context ...ection, which yields a well-defined gradient fit for the indicator function. Several extensions have been made to this original formulation, addressing limitations related to streaming reconstruction =-=[MPS08]-=-, faithfulness to the input [KH13], and sensitivity to normals [ACSTD07]. The work of [MPS08] solves the Poisson equation in a similar manner to [Kaz05], but rather than using a Fourier basis, it uses... |

22 | Structure-aware shape processing, in: - Mitra, Wand, et al. - 2013 |

21 | Anisotropic point set surfaces
- Adamson, Alexa
- 2006
(Show Context)
Citation Context ...se smoothness is a class of feature-preserving methods based on implicit representations. Sharp features can be captured through locally adapted anisotropic basis functions [DTS01]. Adamson and Alexa =-=[AA06]-=- rely on an anisotropic moving least squares (MLS) approach, where the anisotropy is based on principal curvatures derived from the points’ positions and normals. Oztireli et al. [OGG09] extend the ML... |

21 | Surface reconstruction through point set structuring
- Lafarge, Alliez
(Show Context)
Citation Context ... #sorganic skeleton curve Geometric Primitives Primitive Completion [SDK09] # # #s✓ CAD volumetric segmentation Volume Primitives [XF12] # # #s✓ indoor environment interior volume Point Restructuring =-=[LA13]-=- # # # # # ✓ ✓ general volumetric segmentation CCDT [vKvLV13] # # # # ✓ ✓ urban environment volumetric segmentation Global Regularity Symmetry [PMW∗08] # #s✓ architectural point set Nonlocal Consolida... |

20 | O-Snap: Optimization-Based Snapping for Modeling Architecture - Arikan, Schwärzler, et al. |

20 |
PELLACINI F.: Meshflow: interactive visualization of mesh construction sequences
- DENNING, KERR
- 2011
(Show Context)
Citation Context ...f reproducibility and provenance is well studied in other areas, including visualization and scientific workflows [SFC07,FKSS08], and it has been shown to be useful for studying 3D model construction =-=[DKP11]-=-. Given the increasing complexity of reconstruction algorithms, the issue of reproducibility is likely to be of increasing importance. 11. Conclusions The area of surface reconstruction has grown from... |

20 | Fusion of depth maps with multiple scales
- Fuhrmann, Goesele
(Show Context)
Citation Context ...licit field TVL1-VRIP [ZPB07] #s# # # ✓ general implicit field Signing the Unsigned [MDGD∗10] #s# ✓ general implicit field Cone Carving [SSZCO10] # #s✓ ✓ general implicit field Multi-Scale Scan Merge =-=[FG11]-=-s# ✓ general implicit field Volumetric smoothness ROSA [TZCO09] # #s✓ organic skeleton curve Arterial Snakes [LLZM10] # #s✓ man-made skeleton curve VASE [TOZ∗11] # #s✓ general implicit field l1 Skelet... |

20 | KERIVEN R.: Robust and efficient surface reconstruction from range data
- LABATUT, PONS
(Show Context)
Citation Context ...in regions of missing data, while using line-of-sight as a datafitting term. Existing approaches solve such a formulation via level-set models [Whi98] and graph cut optimization [LB07]. The method of =-=[LPK09]-=- seeks an interior and exterior labeling of tetrahedra from a Delaunay triangulation of the point cloud, similar to [KSO04], but formulates it as a graph cut problem using line of sight information. A... |

19 | Robust smooth feature extraction from point clouds
- Daniels, Ha, et al.
- 2007
(Show Context)
Citation Context ...on. Piecewise smooth methods are focused on explicitly recovering sharp features or boundary components, while ensuring smoothness away from these features, where smoothness may be prescribed locally =-=[DHOS07]-=- or globally [ASGCO10]. Notation. We first fix the notation for this section and all subsequent sections. We assume that we are given a point cloud P which is a sampling of a shape S. Individual point... |

19 |
Duygu Ceylan. Symmetry in 3d geometry: Extraction and applications
- Mitra, Pauly, et al.
- 2012
(Show Context)
Citation Context ...e the scan into missing regions, shown on the right. have also shown to be of great use in handling severe defects in a point cloud. 7.1. Symmetry Symmetry is a well-studied problem in shape analysis =-=[MPWC13]-=-. Symmetry detection is focused on finding either global or local transformations on the shape that maps the entire shape, or a subset of the shape, onto itself. Finding such transformations can be ex... |

19 | Realtime 3D Reconstruction at Scale Using Voxel Hashing,” - Niessner, Zollhöfer, et al. - 2013 |

17 | Analysis, reconstruction and manipulation using arterial snakes,
- Li, Liu, et al.
- 2010
(Show Context)
Citation Context ...t field Cone Carving [SSZCO10] # #s✓ ✓ general implicit field Multi-Scale Scan Merge [FG11]s# ✓ general implicit field Volumetric smoothness ROSA [TZCO09] # #s✓ organic skeleton curve Arterial Snakes =-=[LLZM10]-=- # #s✓ man-made skeleton curve VASE [TOZ∗11] # #s✓ general implicit field l1 Skeleton [HWCO ∗13] # #sorganic skeleton curve Geometric Primitives Primitive Completion [SDK09] # # #s✓ CAD volumetric seg... |

15 |
S.: Dense object reconstruction with semantic priors
- Bao, Chandraker, et al.
(Show Context)
Citation Context ... in the 3D scan. The best combination of candidates that closely match the geometry, while consisting of a small intersection with each other, composes the final model. Model-based SFM. The method of =-=[BCLS13]-=- performs reconstruction at the category level (i.e. car, fruit), by learning a mean shape prior along with corresponding feature points on the shape from a given set of object instances acquired thro... |

14 | Shape analysis with subspace symmetries - Berner, Wand, et al. - 2011 |

14 | Point cloud skeletons via laplacian-based contraction. - Cao, Tagliasacchi, et al. - 2010 |

14 | L1-medial skeleton of point cloud - Huang, Wu, et al. |

11 |
Polygon mesh repairing: An application perspective
- Attene, Campen, et al.
- 2013
(Show Context)
Citation Context ...ace with boundary from a point cloud, this can be quite challenging given other imperfections in the data. These methods are not covered in this survey and we refer the reader to the recent survey of =-=[ACK13]-=- on surface completion. Interpolatory reconstruction. An important field of surface reconstruction methods are those that interpolate a point cloud without any additional information, such as normals ... |

10 |
Image-based Reconstruction and Synthesis of Dense Foliage
- Bradley, Nowrouzezahrai, et al.
(Show Context)
Citation Context ...n process, which must be compensated by an increased robustness of the algorithms and structural or physical a priori knowledge. Recent works in hair reconstruction [LLR13] and foliage reconstruction =-=[BNB13]-=- demonstrate the challenges brought on by acquisition in uncontrolled environments. Big data and online algorithms. Last, the scale of acquired data is also quickly growing: we no longer deal exclusiv... |

10 | Surface reconstruction from fitted shape primitives
- Jenke, Krückeberg, et al.
- 2008
(Show Context)
Citation Context ... in the presence of noise, outliers and missing data. (right) The primitives can then be extrapolated to obtain a watertight surface from incomplete data [SDK09]. Primitive consolidation. The work of =-=[JKS08]-=- takes a set of detected plane primitives and performs reconstruction by aligning and merging the boundaries of adjacent primitives. More specifically, the boundaries of the plane primitives are extra... |

10 | Patch-Graph Reconstruction for Piecewise Smooth Surfaces
- Jenke, Wand, et al.
- 2008
(Show Context)
Citation Context ...truct a minimum-spanning tree to infer a feature graph. Daniels et al. [DHOS07] uses a robust projection operator onto sharp creases and grow a set of polylines through projected points. Jenke et al. =-=[JWS08]-=- extract feature lines by robustly fitting local surface patches and computing the intersection of close patches with dissimilar normals. Sharp and robust.Only few approaches tackle the combined issue... |

10 |
H.: Smoothing of partition of unity implicit surfaces for noise robust surface reconstruction
- NAGAI, OHTAKE, et al.
- 2009
(Show Context)
Citation Context ...depending on the form of missing data. To resolve such poor fits, a diffusion operator can be defined on the collection of shape fits, in order to perform smoothing directly on the MPU representation =-=[NOS09]-=-. Parameterization-free projection. These methods project the point cloud, without normals, onto the multivariate median, where a point balancing term ensures samples are asuniformly-as-possible distr... |

9 | Visibility of noisy point cloud data
- Mehra, Tripathi, et al.
(Show Context)
Citation Context ...rical inversion of the point cloud with respect to the given query point is computed. Then, visible points are simply identified as those that lie on the convex hull of this set – see Figure 8. While =-=[MTSM10]-=- extended this method to handle moderate levels of noise, the input point cloud must respect strict sampling assumptions to produce satisfactory results. Occlusion culling. The method of [CCLN10] buil... |

8 | A benchmark for surface reconstruction, - Berger, Levine, et al. - 2013 |

8 | A survey of methods for moving least squares surfaces - Cheng, Wang, et al. - 2008 |

8 | Edge-aware point set resampling - Huang, Wu, et al. |

8 |
D.: Error bounds and optimal neighborhoods for mls approximation
- Lipman, Cohen-Or, et al.
(Show Context)
Citation Context .... This may be done via a user-defined scale proportional to an estimation of the density [GG07], as well as methods whose support is derived from a data-dependent error bound on the MLS approximation =-=[LCOL06]-=-. However, MLS methods are in general unable to provide a good surface approximation in the presence of missing data, since it is necessary to use a rather large spatial support size in such regions f... |

6 | Structure-aware hair capture
- LUO, LI, et al.
- 2013
(Show Context)
Citation Context ...a lower control over the acquisition process, which must be compensated by an increased robustness of the algorithms and structural or physical a priori knowledge. Recent works in hair reconstruction =-=[LLR13]-=- and foliage reconstruction [BNB13] demonstrate the challenges brought on by acquisition in uncontrolled environments. Big data and online algorithms. Last, the scale of acquired data is also quickly ... |

5 |
Orienting unorganized points for surface reconstruction
- Liu, Wang
(Show Context)
Citation Context ...truction [KBH06] on this point cloud are shown in mid-left, where we indicate unwanted surface components due to the clustered normal flips. Similarly, on the right we show the orientation results of =-=[LW10]-=-, and the corresponding results of [KBH06]. 2.2.2. Scanner Information The scanner from which the point cloud was acquired can provide useful information for surface reconstruction. As discussed, the ... |

5 | ALLIEZ P.: Indoor scene reconstruction using primitive-driven space partitioning and graphcut.
- OESAU, LAFARGE
- 2013
(Show Context)
Citation Context ...a function of line of sight information. A similar process is used to stack up these slices to build a set of volumetric primitives, producing a 3D CSG model that composes the interior. The method of =-=[OLA13]-=- starts from a volume decomposition of the space, and labels volumetric cells as interior and exterior through a parity-driven cost function solved via graph cuts, where parity is measured through ray... |

4 | Y.: Feature-preserving reconstruction of singular surfaces - DEY, GE, et al. - 2012 |

4 | EL-SANA J.: Automatic reconstruction of tree skeletal structures from point clouds - LIVNY, YAN, et al. |

3 | C.: Computing and rendering point set surfaces. Trans - ALEXA, BEHR, et al. - 2003 |

3 |
COHEN-OR D.: ℓ1-sparse reconstruction of sharp point set surfaces
- AVRON, SHARF, et al.
- 2010
(Show Context)
Citation Context ... other methods for computing unoriented normals: using a weighted covariance matrix [PMG04], higher-order approximations via osculating jets [CP05], or robust methods that employ l1 norm minimization =-=[ASGCO10]-=-. Common to all methods is the need to define a local neighborhood of points, where the neighborhood should be small enough to accurately represent a point’s tangent space. The scale of the neighborho... |

3 |
Binary orientation trees for volume and surface reconstruction from unoriented point clouds, Computer Graphics Forum 29
- Chen, Chen, et al.
(Show Context)
Citation Context ...hile [MTSM10] extended this method to handle moderate levels of noise, the input point cloud must respect strict sampling assumptions to produce satisfactory results. Occlusion culling. The method of =-=[CCLN10]-=- builds upon these ideas and reconstructs a watertight surface by carving c© Author version Berger et al. / State of the Art in Surface Reconstruction from Point Clouds Figure 9: The approach of [MDGD... |

3 | Online facade reconstruction from dominant frequencies in structured point clouds
- FRIEDMAN, STAMOS
(Show Context)
Citation Context ... extruded at each depth layer to obtain a polygonal representation of the building, at the possible expense of detail in the geometry due to the lack of expression in the shape grammar. The method of =-=[FS12]-=- tackles occluded facade scans by analyzing vertical scanlines consisting of columns of points along major facade planes to detect periodic features. The Discrete Fourier Transform is computed for eac... |

3 |
Noise-Adaptive Shape Reconstruction from Raw Point Sets
- Giraudot, Cohen-Steiner, et al.
(Show Context)
Citation Context ...mpose smoothness on the output [KBH06], as well as methods that employ robust statistics [OGG09], are common ways of handling noise. We note that spatially varying noise poses a significant challenge =-=[GCSA13]-=-, where for many scanners, the noise level is correlated with the depth measurement – see [KE12] for such an error study done on the Kinect. Outliers. Points that are far from the true surface are cla... |

2 |
T.: Medial kernels
- BERGER, SILVA
- 2012
(Show Context)
Citation Context ... clouds [LYO∗10]. Generalized volumetric smoothness. Several methods exist for imposing volumetric smoothness on the medial axis of the shape, supporting a much broader class of shapes. The method of =-=[BS12]-=- approaches reconstruction by segmenting the point cloud into volumetric regions and in each region taking the union of balls to obtain a coarse surface representation. The union of these regions then... |

2 | IZADI S.: Scalable realtime volumetric surface reconstruction - CHEN, BAUTEMBACH - 2013 |

2 | Single viewpoint model completion of symmetric objects for digital inspection. Computer Vision Image Understanding
- LAW, ALIAGA
- 2011
(Show Context)
Citation Context ...tire shape, or a subset of the shape, onto itself. Finding such transformations can be extremely useful for surface reconstruction in handling noise and missing data. Global similarity. The method of =-=[LA11]-=- applies this to the case of missing data for single-scan completion by finding small surface patches of the scan that exhibit either bilateral, rotational, or surface-of-revolution symmetry, and then... |

2 | S.: Isosurfaces over simplicial partitions of multiresolution grids - MANSON, SCHAEFER - 2010 |

2 | An algorithm for extracting geometric features from point cloud - Pang, Pang - 2009 |

2 |
PURGATHOFER W.: Reconstructing shape boundaries with multimodal constraints
- REISNER-KOLLMANN, MAIERHOFER
- 2013
(Show Context)
Citation Context ...rmation to penalize c© Author version Berger et al. / State of the Art in Surface Reconstruction from Point Clouds facets in the complex lying in regions marked empty via space carving. The method of =-=[RKMP13]-=- uses the point cloud, line of sight, and edge features in corresponding RGB images to infer constraints for finding the boundary of each input shape primitive, consequently producing the reconstructe... |

1 | S.-H.: Bipartite polar classification for surface reconstruction. Computer Graphics Forum
- CHEN, LEE, et al.
- 2011
(Show Context)
Citation Context ...ions. Similarly to [KTB07], the input cloud has to satisfy certain stringent sampling conditions, limiting its effectiveness with undersampling and missing data. Conditions on sampling are relaxed in =-=[CLCL11]-=- where inconsistencies are detected by observing that if one point’s Voronoi pole [AB99] lies in the exterior, the other Voronoi pole should be in the interior. If both are occluded or visible via [KT... |