CGAL 6.1 - Point Set Processing
Loading...
Searching...
No Matches
CGAL::poisson_eliminate_impl Namespace Reference

Classes

struct  Compute_squared_distance
 
struct  Compute_squared_distance< Point, 2 >
 
struct  Compute_squared_distance< Point, 3 >
 
class  Indexed_extended_point_map
 
struct  Search_traits
 
struct  Search_traits< Point, 2 >
 
struct  Search_traits< Point, 3 >
 
class  Weight_functor
 

Functions

double get_maximum_radius (std::size_t dimension, std::size_t sample_size, double domain_size)
 
double get_minimum_radius (std::size_t input_size, std::size_t output_size, double beta, double gamma, double r_max)
 
template<class Point , class FT = typename CGAL::Kernel_traits<Point>::FT, unsigned int dim = CGAL::Ambient_dimension<Point>::value>
Point construct (const std::array< FT, dim > &coords)
 
template<class Point , class FT = typename CGAL::Kernel_traits<Point>::FT>
void copy_and_replace (const Point &in, Point &out, std::size_t replace, FT value)
 
void move_down (std::vector< std::size_t > &heap, std::vector< std::size_t > &heap_pos, std::size_t heap_size, std::vector< double > &weights, std::size_t idx)
 
void pop_heap (std::vector< std::size_t > &heap, std::vector< std::size_t > &heap_pos, std::size_t &heap_size, std::vector< double > &weights)