Results 1  10
of
14
Analysis, Reconstruction and Manipulation using Arterial Snakes
"... metal stool scanned pointset skeletal snakes arterial snake network edited model Figure 1: Starting from a noisy raw scan with large parts missing our algorithm analyzes and extracts a curve network with associated crosssectional profiles providing a reconstructed model. The extracted highlevel sh ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
metal stool scanned pointset skeletal snakes arterial snake network edited model Figure 1: Starting from a noisy raw scan with large parts missing our algorithm analyzes and extracts a curve network with associated crosssectional profiles providing a reconstructed model. The extracted highlevel shape representation enables easy, intuitive, yet powerful geometry editing. Note that our algorithm is targeted towards delicate 1D features and fails to detect the small disc at the top of the stool. Manmade objects often consist of detailed and interleaving structures, which are created using cane, coils, metal wires, rods, etc. The delicate structures, although manufactured using simple procedures, are challenging to scan and reconstruct. We observe that such structures are inherently 1D, and hence are naturally represented using an arrangement of generating curves. We refer to the resultant surfaces as arterial surfaces. In this paper we approach for analyzing, reconstructing, and manipulating such arterial surfaces. ∗ Corresponding authors:
L1Medial Skeleton of Point Cloud
"... We introduce L1medial skeleton as a curve skeleton representation for 3D point cloud data. The L1median is wellknown as a robust global center of an arbitrary set of points. We make the key observation that adapting L1medians locally to a point set representing a 3D shape gives rise to a onedim ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We introduce L1medial skeleton as a curve skeleton representation for 3D point cloud data. The L1median is wellknown as a robust global center of an arbitrary set of points. We make the key observation that adapting L1medians locally to a point set representing a 3D shape gives rise to a onedimensional structure, which can be seen as a localized center of the shape. The primary advantage of our approach is that it does not place strong requirements on the quality of the input point cloud nor on the geometry or topology of the captured shape. We develop a L1medial skeleton construction algorithm, which can be directly applied to an unoriented raw point scan with significant noise, outliers, and large areas of missing data. We demonstrate L1medial skeletons extracted from raw scans of a variety of shapes, including those modeling highgenus 3D objects, plantlike structures, and curve networks.
State of the Art in Surface Reconstruction from Point Clouds
 IN PROC. EUROGRAPHICS 2014
, 2014
"... ..."
Article Change Detection of Tree Biomass with Terrestrial Laser Scanning and Quantitative Structure Modelling
, 2014
"... remote sensing ..."
(Show Context)
Probabilistic viewbased 3D curve skeleton computation on
 the GPU,” in Proc. VISAPP, 2013
"... Abstract: Computing curve skeletons of 3D shapes is a challenging task. Recently, a highpotential technique for this task was proposed, based on integrating medial information obtained from several 2D projections of a 3D shape (Livesu et al., 2012). However effective, this technique is strongly inf ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract: Computing curve skeletons of 3D shapes is a challenging task. Recently, a highpotential technique for this task was proposed, based on integrating medial information obtained from several 2D projections of a 3D shape (Livesu et al., 2012). However effective, this technique is strongly influenced in terms of complexity by the quality of a socalled skeleton probability volume, which encodes potential 3D curveskeleton locations. In this paper, we extend the above method to deliver a highly accurate and discriminative curveskeleton probability volume. For this, we analyze the error sources of the original technique, and propose improvements in terms of accuracy, culling false positives, and speed. We show that our technique can deliver pointcloud curveskeletons which are close to the desired locations, even in the absence of complex postprocessing. We demonstrate our technique on several 3D models. 1
Automation of Dormant Pruning in Specialty Crop Production: An Adaptive Framework for Automatic Reconstruction and Modeling of Apple Trees
"... Dormant pruning is one of the most costly and laborintensive operations in specialty crop production. During winter, a large crew of trained seasonal workers has to carefully remove the branches from hundreds of trees using a set of predefined rules. The goal of automatic pruning is to reduce thi ..."
Abstract
 Add to MetaCart
(Show Context)
Dormant pruning is one of the most costly and laborintensive operations in specialty crop production. During winter, a large crew of trained seasonal workers has to carefully remove the branches from hundreds of trees using a set of predefined rules. The goal of automatic pruning is to reduce this dependence on a large workforce that is currently needed for the job. Automatically applying the pruning “rules ” entails construction of 3D models of the trees in their dormant condition (that is, without foliage) and accurate estimation of the pruning points on the branches. This paper investigates the use of Skeletonbased Geometric (SbG) features in a 3D reconstruction scheme. The results obtained demonstrate the effectiveness of the SbG features for automatic reconstruction using only two views — the front and the back. Our results show that our proposed scheme locates the pruning points on the tree branches with an accuracy of 96.0%. The algorithm that locates the pruning points is based on a new adaptive circlebasedlayeraware modeling scheme for the trunks and the primary branches “PBs ” of the trees. Its three main steps are detection, segmentation, and modeling. Localization of the pruning points on the tree branches is a part of the modeling step. Both qualitative and quantitative evaluation are performed on a new challenging appletrees dataset that is collected for the purpose of evaluating our approach. 1.
Parallelization of Mesh Contraction and Fairing using OpenCL Martin
"... We propose a parallel method for computing local Laplacian curvature flows for triangular meshes. Laplace operator is widely used in mesh processing for mesh fairing, noise removal or curvature estimation. If the Laplacian flow is used in global sense constraining a whole mesh with an iterative we ..."
Abstract
 Add to MetaCart
We propose a parallel method for computing local Laplacian curvature flows for triangular meshes. Laplace operator is widely used in mesh processing for mesh fairing, noise removal or curvature estimation. If the Laplacian flow is used in global sense constraining a whole mesh with an iterative weighted linear system, it can be used even for mesh contraction. However, numerical solution of such a global linear system is computationally expensive. Therefore, we have developed a method to compute such an iterative linear system using only local neighbourhoods of each vertex in parallel. Parallel computation of local linear systems is performed on GPU using OpenCL. We have evaluated speedups of the parallelization using both local and global Laplacian flows. We show test cases, where the parallel local method can be used for mesh fairing. In contrary, we also investigate and outline a fail case, where the local Laplacian flow cannot be used. When the local Laplacian flow has problems with global convergence, we offer a global parallelization of the linear system solving as an alternative. CR Categories: Computer Graphics [I.3.5]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems
A Kinematics Significance Based Skeleton Map for Rapid Viewpoint Selection
, 2012
"... Abstract: Viewpoint selection has become a very active area of research during the last decade. Computation of good viewpoints is important in graph drawing, scene understanding, etc. A good viewpoint can give us rich information about a scene. In this study, we present a novel Kinematics Significa ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: Viewpoint selection has become a very active area of research during the last decade. Computation of good viewpoints is important in graph drawing, scene understanding, etc. A good viewpoint can give us rich information about a scene. In this study, we present a novel Kinematics Significance based Skeleton Map (KSSM) during iterative Laplacian contraction. Inspired by salient viewpoint selection, we propose a new rapid computation method based on a few initial viewpoints for iteration. It allows us to compute the final best viewpoint via Loop subdivision stencil rapidly for iterative decision under a threshold. Experimental results demonstrate that the KSSM can describe the topology information of 3D mesh effectively. It also presents the validity and effectiveness of viewpoint selection based on KSSM.
The final publication is available at link.springer.com. Qualitative Comparison of Contractionbased Curve Skeletonization Methods
"... Abstract. In recent years, many new methods have been proposed for extracting curve skeletons of 3D shapes, using a meshcontraction principle. However, it is still unclear how these methods perform with respect to each other, and with respect to earlier voxelbased skeletonization methods, from the ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In recent years, many new methods have been proposed for extracting curve skeletons of 3D shapes, using a meshcontraction principle. However, it is still unclear how these methods perform with respect to each other, and with respect to earlier voxelbased skeletonization methods, from the viewpoint of certain quality criteria known from the literature. In this study, we compare six recent contractionbased curveskeletonization methods and one recent voxelbased method, against six accepted quality criteria, on a set of complex 3D shapes. Our results reveal previously unknown limitations of the compared methods, and link these limitations to algorithmic aspects of the studied methods.
Mean Curvature Skeletons
"... Figure 1: Given a watertight surface (a), the wellknown medial axis transform (b) often produces too complex of a structure to be of practical use. Our skeletonization algorithm can produce intermediate mesoskeletons (c), which contain medial sheets where needed and curves where appropriate, while ..."
Abstract
 Add to MetaCart
Figure 1: Given a watertight surface (a), the wellknown medial axis transform (b) often produces too complex of a structure to be of practical use. Our skeletonization algorithm can produce intermediate mesoskeletons (c), which contain medial sheets where needed and curves where appropriate, while converging to a medially centered curve skeleton output (d). Inspired by recent developments in contractionbased curve skeleton extraction, we formulate the skeletonization problem via mean curvature flow (MCF). While the classical application of MCF is surface fairing, we take advantage of its areaminimizing characteristic to drive the curvature flow towards the extreme so as to collapse the input mesh geometry and obtain a skeletal structure. By analyzing the differential characteristics of the flow, we reveal that MCF locally increases shape anisotropy. This justifies the use of curvature motion for skeleton computation, and leads to the generation of what we call “mean curvature skeletons”. To obtain a stable and efficient discretization, we regularize the surface mesh by performing local remeshing via edge splits and collapses. Simplifying mesh connectivity throughout the motion leads to more efficient computation and avoids numerical instability arising from degeneracies in the triangulation. In addition, the detection of collapsed geometry is facilitated by working with simplified mesh connectivity and monitoring potential nonmanifold edge collapses. With topology simplified throughout the flow, minimal postprocessing is required to convert the collapsed geometry to a curve. Formulating skeletonization via MCF allows us to incorporate external energy terms easily, resulting in a constrained flow. We define one such energy term using the Voronoi medial skeleton and obtain a medially centred curve skeleton. We call the intermediate results of our skeletonization motion mesoskeletons; these consist of a mixture of curves and surface sheets as appropriate to the local 3D geometry they capture. 1.