CGAL 4.11.3 - 3D Point Set
|
This module offers convenience overloads of functions available in the Point Set Processing package.
These overloads allow the user to call point set processing algorithms without having to handle manually property maps and iterators.
The overloads, available after including CGAL/Point_set_3/Point_set_processing_3.h
, all follow the same pattern based on the original point set processing functions:
CGAL::Point_set_3<Point,Vector>
For a complete documentation of these functions, please refer to the Point Set Processing Reference manual.
Functions | |
template<typename Concurrency_tag , typename Point , typename Vector > | |
double | CGAL::bilateral_smooth_point_set (CGAL::Point_set_3< Point, Vector > &point_set, const unsigned int k, double sharpness_angle) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
double | CGAL::compute_average_spacing (const CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
void | CGAL::edge_aware_upsample_point_set (CGAL::Point_set_3< Point, Vector > &point_set, double sharpness_angle=30, double edge_sensitivity=1, double neighbor_radius=-1, const std::size_t number_of_output_points=1000) |
template<typename Point , typename Vector > | |
void | CGAL::grid_simplify_point_set (CGAL::Point_set_3< Point, Vector > &point_set, double epsilon) |
template<typename Point , typename Vector > | |
void | CGAL::hierarchy_simplify_point_set (CGAL::Point_set_3< Point, Vector > &point_set, const unsigned int size=10, const double var_max=0.333) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
void | CGAL::jet_estimate_normals (CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k, unsigned int degree_fitting=2) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
void | CGAL::jet_smooth_point_set (CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k, unsigned int degree_fitting=2, unsigned int degree_monge=2) |
template<typename Point , typename Vector > | |
CGAL::Point_set_3< Point, Vector >::iterator | CGAL::mst_orient_normals (CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
void | CGAL::pca_estimate_normals (CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k) |
template<typename Point , typename Vector > | |
void | CGAL::random_simplify_point_set (CGAL::Point_set_3< Point, Vector > &point_set, double removed_percentage) |
template<typename Point , typename Vector > | |
void | CGAL::remove_outliers (CGAL::Point_set_3< Point, Vector > &point_set, unsigned int k, double threshold_percent) |
template<typename Point , typename Vector > | |
void | CGAL::vcm_estimate_normals (CGAL::Point_set_3< Point, Vector > &point_set, double offset_radius, double convolution_radius) |
template<typename Point , typename Vector > | |
void | CGAL::vcm_estimate_normals (CGAL::Point_set_3< Point, Vector > &point_set, double offset_radius, unsigned int nb_neighbors_convolve) |
template<typename Concurrency_tag , typename Point , typename Vector > | |
void | CGAL::wlop_simplify_and_regularize_point_set (const CGAL::Point_set_3< Point, Vector > &input_point_set, CGAL::Point_set_3< Point, Vector > &output_point_set, const double select_percentage=5, double neighbor_radius=-1, const unsigned int max_iter_number=35, const bool require_uniform_sampling=false) |
double CGAL::bilateral_smooth_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
const unsigned int | k, | ||
double | sharpness_angle | ||
) |
point_set | point set |
k | number of neighbors. |
sharpness_angle | control sharpness(0-90) |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
double CGAL::compute_average_spacing | ( | const CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k | ||
) |
point_set | point set |
k | number of neighbors. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::edge_aware_upsample_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
double | sharpness_angle = 30 , |
||
double | edge_sensitivity = 1 , |
||
double | neighbor_radius = -1 , |
||
const std::size_t | number_of_output_points = 1000 |
||
) |
point_set | point set |
sharpness_angle | control sharpness(0-90) |
edge_sensitivity | edge sensitivity(0-5) |
neighbor_radius | initial size of neighbors. |
number_of_output_points | number of output points. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::grid_simplify_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
double | epsilon | ||
) |
point_set | point set |
epsilon | tolerance value when merging 3D points. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::hierarchy_simplify_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
const unsigned int | size = 10 , |
||
const double | var_max = 0.333 |
||
) |
point_set | point set |
size | maximum cluster size |
var_max | maximal surface variation |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::jet_estimate_normals | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k, | ||
unsigned int | degree_fitting = 2 |
||
) |
point_set | point set |
k | number of neighbors. |
degree_fitting | fitting degree |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::jet_smooth_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k, | ||
unsigned int | degree_fitting = 2 , |
||
unsigned int | degree_monge = 2 |
||
) |
point_set | point set |
k | number of neighbors. |
degree_fitting | fitting degree |
degree_monge | Monge degree |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
CGAL::Point_set_3<Point, Vector>::iterator CGAL::mst_orient_normals | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k | ||
) |
point_set | point set |
k | number of neighbors |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::pca_estimate_normals | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k | ||
) |
point_set | point set |
k | number of neighbors. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::random_simplify_point_set | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
double | removed_percentage | ||
) |
point_set | point set |
removed_percentage | percentage of points to remove |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::remove_outliers | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
unsigned int | k, | ||
double | threshold_percent | ||
) |
point_set | point set |
k | number of neighbors. |
threshold_percent | percentage of points to remove |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::vcm_estimate_normals | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
double | offset_radius, | ||
double | convolution_radius | ||
) |
point_set | point set |
offset_radius | offset radius. |
convolution_radius | convolution radius. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::vcm_estimate_normals | ( | CGAL::Point_set_3< Point, Vector > & | point_set, |
double | offset_radius, | ||
unsigned int | nb_neighbors_convolve | ||
) |
point_set | point set |
offset_radius | offset radius. |
nb_neighbors_convolve | number of neighbors used during the convolution. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>
void CGAL::wlop_simplify_and_regularize_point_set | ( | const CGAL::Point_set_3< Point, Vector > & | input_point_set, |
CGAL::Point_set_3< Point, Vector > & | output_point_set, | ||
const double | select_percentage = 5 , |
||
double | neighbor_radius = -1 , |
||
const unsigned int | max_iter_number = 35 , |
||
const bool | require_uniform_sampling = false |
||
) |
input_point_set | input point set |
output_point_set | output point set |
select_percentage | percentage of points to retain |
neighbor_radius | size of neighbors. |
max_iter_number | number of iterations. |
require_uniform_sampling | if needed to compute density to generate more rugularized result. |
#include <CGAL/Point_set_3/Point_set_processing_3.h>