关闭

CGAL::compute_average_spacing

标签: iteratorinputparametersprocessing
484人阅读 评论(0) 收藏 举报
分类:

转自:http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Point_set_processing_3_ref/Function_compute_average_spacing.html#Cross_link_anchor_1647

Definition

CGAL::compute_average_spacing() computes the average spacing of all points from the input set to their k nearest neighbors. This value depends on the k parameter which can be set to 6 for isotropically sampled surfaces.

#include <CGAL/compute_average_spacing.h>

template<typename InputIterator, typename PointPMap, typename Kernel>
Kernel::FT
compute_average_spacing ( InputIterator first,
InputIterator beyond,
PointPMap point_pmap,
unsigned int k,
Kernel kernel)
    Computes average spacing from k nearest neighbors.
Precondition:  k >= 2.
Template Parameters: 
InputIterator: iterator over input points. PointPMap: is a model of boost::ReadablePropertyMap with a value_type = Point_3<Kernel>. It can be omitted if InputIterator value_type is convertible to Point_3<Kernel>. Kernel: Geometric traits class. It can be omitted and deduced automatically from PointPMap value_type.
Returns:  average spacing (scalar).
Parameters: 
first: iterator over the first input point. beyond: past-the-end iterator over the input points. point_pmap: property map InputIterator -> Point_3. k: number of neighbors. kernel: geometric traits.

Example

See average_spacing_example.cpp.

 

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:426501次
    • 积分:4720
    • 等级:
    • 排名:第6142名
    • 原创:15篇
    • 转载:263篇
    • 译文:0篇
    • 评论:66条
    最新评论