Abstract. A novel region growing algorithm is proposed for triangular mesh recovery from scattered 3D points. In our method, the new principle is used to determine the seed triangle considering both maximum angle and minimum length; the open influence region is defined for the active edge under processing; positional element is added into the criterion to choose the most suitable active point; geometric integrity is maintained by analyzing different situations of the selected active point and their corresponding treatments. Our approach has been tested with various unorganized point clouds, and the experimental results proved its efficiency in both accuracy and speed. Compared with the existing similar techniques, our algorithm has the abil...
In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. T...
Limited by the regular grids in computing, many modelling approaches (e.g., field-based methods) sam...
Objective of this paper is to propose a new semi-automatic, adaptive and optimized triangular mesh ...
A novel region growing algorithm is proposed for triangular mesh recovery from scattered 3D points. ...
Abstract — A new algorithm is proposed for triangular mesh reconstruction from 3D scattered points b...
The surface reconstruction from cloud of points is a problem, which can be encountered in many appli...
In order to overcome the disadvantages of mesh-growing method for large-scaleor normal information n...
In this paper, a new approach, "the Maximum Opposite Angulation (MOA for short)" algorithm, for the ...
In this paper, we propose a new method for approximating an unorganized set of points scattered over...
The marching cube algorithm is currently one of the most popular three-dimensional (3D) reconstructi...
This paper builds a 3D laser scanner by a one-dimensional pitching rotation pan-tilt and a 2D laser ...
In this paper, we propose a new method for approximating an unorganized set of points scattered over...
International audienceGiven a set of points S ∈ R 2 , reconstruction is a process of identifying the...
We present a new procedure to compute dense 3D point clouds from a sequential set of images. This pr...
We present a method for solving the following problem: Given a set of data points scattered in three...
In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. T...
Limited by the regular grids in computing, many modelling approaches (e.g., field-based methods) sam...
Objective of this paper is to propose a new semi-automatic, adaptive and optimized triangular mesh ...
A novel region growing algorithm is proposed for triangular mesh recovery from scattered 3D points. ...
Abstract — A new algorithm is proposed for triangular mesh reconstruction from 3D scattered points b...
The surface reconstruction from cloud of points is a problem, which can be encountered in many appli...
In order to overcome the disadvantages of mesh-growing method for large-scaleor normal information n...
In this paper, a new approach, "the Maximum Opposite Angulation (MOA for short)" algorithm, for the ...
In this paper, we propose a new method for approximating an unorganized set of points scattered over...
The marching cube algorithm is currently one of the most popular three-dimensional (3D) reconstructi...
This paper builds a 3D laser scanner by a one-dimensional pitching rotation pan-tilt and a 2D laser ...
In this paper, we propose a new method for approximating an unorganized set of points scattered over...
International audienceGiven a set of points S ∈ R 2 , reconstruction is a process of identifying the...
We present a new procedure to compute dense 3D point clouds from a sequential set of images. This pr...
We present a method for solving the following problem: Given a set of data points scattered in three...
In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. T...
Limited by the regular grids in computing, many modelling approaches (e.g., field-based methods) sam...
Objective of this paper is to propose a new semi-automatic, adaptive and optimized triangular mesh ...