CGAL::output_surface_facets_to_polyhedron

转自:http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Surface_mesher_ref/Function_output_surface_facets_to_polyhedron.html#Cross_link_anchor_1497

Definition

output_surface_facets_to_polyhedron() converts a surface reconstructed by make_surface_mesh() to a Polyhedron_3<Traits>.

#include <CGAL/IO/output_surface_facets_to_polyhedron.h>

template<class SurfaceMeshComplex_2InTriangulation_3, class Polyhedron>
bool
output_surface_facets_to_polyhedron ( SurfaceMeshComplex_2InTriangulation_3 c2t3,
Polyhedron& output_polyhedron)
  Gets reconstructed surface out of a SurfaceMeshComplex_2InTriangulation_3 object.
This variant exports the surface as a polyhedron. It requires the surface to be manifold. For this purpose, you may call make_surface_mesh() with Manifold_tag or Manifold_with_boundary_tag parameter.
Template Parameters: 
SurfaceMeshComplex_2InTriangulation_3: model of the SurfaceMeshComplex_2InTriangulation_3 concept. Polyhedron: an instance of Polyhedron_3<Traits>.
Returns: true if the surface is manifold and orientable.
Parameters: 
c2t3: Input surface. output_polyhedron: Output polyhedron.

See Also

CGAL::output_surface_facets_to_off

 

int main(int argc, const char** argv) { //****************************************获取数据***************************************************** const std::string input_filename = (argc > 1) ? argv[1] : CGAL::data_file_path("C:\\Users\\lwc\\source\\repos\\Project4\\x64\\Release\\output.xyz"); const char* output_filename = (argc > 2) ? argv[2] : "C:\\Users\\lwc\\source\\repos\\Project4\\x64\\Release\\113.xyz"; //输出文件名称 std::vector<PointVectorPair> points; if (!CGAL::IO::read_points(input_filename, std::back_inserter(points), CGAL::parameters::point_map(CGAL::First_of_pair_property_map<PointVectorPair>()) .normal_map(CGAL::Second_of_pair_property_map<PointVectorPair>()))) { std::cerr << "Error: cannot read file " << input_filename << std::endl; return EXIT_FAILURE; } //****************************************点云平滑************************************************* unsigned int k = 5; //邻近点数 double offset_radius = 0.01; CGAL::vcm_estimate_normals<std::vector<PointVectorPair>>(points, offset_radius, k, CGAL::parameters::point_map(CGAL::First_of_pair_property_map<PointVectorPair>()) .normal_map(CGAL::Second_of_pair_property_map<PointVectorPair>())); //使用vcm算法来获取每个点的法向量,后面的参数指定了我们的点与法向量对于的部分 //********************************************保存数据************************************************* if (!CGAL::IO::write_points(output_filename, points, CGAL::parameters::point_map(CGAL::First_of_pair_property_map<PointVectorPair>()) .normal_map(CGAL::Second_of_pair_property_map<PointVectorPair>()) .stream_precision(17))) return EXIT_FAILURE; std::cout << "计算结束!" << std::endl; return EXIT_SUCCESS; } 我想将此算法改成遍历文件夹应该怎么写
07-20
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值