cgal

C++ using two incompatible libraries together, what are the options?

此生再无相见时 提交于 2021-02-19 05:47:09
问题 I wrote a program using the point cloud library (PCL). Now I want to use some of cgal's algorithms. I've managed to build a cgal class in isolation (all dependencies working etc.) but when I try and combine the two projects I get unresolved external symbol errors So, what are my options for building a cgal project and accessing it (somehow) from my PCL project? I'd be passing a simple vector to the cgal project so in theory none of the specialist libraries have to interact with each other at

Smoothing sharp edges in a mesh

时光毁灭记忆、已成空白 提交于 2021-02-11 14:16:00
问题 I've been trying for days to find the appropriate way of smoothing the sharp corners in this mesh: Been able to properly map the faces and points I wanted to smooth, and applied the following method: namespace PMP = CGAL::Polygon_mesh_processing; PMP::isotropic_remeshing( faces_to_smoothen, 0.2, wrap, PMP::parameters::number_of_iterations(5). face_patch_map(fccmap)); Followed by: PMP::smooth_shape(wrap, 0.1e-5, PMP::parameters::number_of_iterations(200).vertex_is_constrained_map(vcmap)); Got

Is there any way to get CGAL's polyline simplification to work for inner/shared boundaries?

对着背影说爱祢 提交于 2021-02-10 05:22:08
问题 I've been trying to carry out line simplification on polygons belonging to maps with the help of this CGAL guide, e.g. South Korea. This is a screenshot of South Korea after line simplification with CGAL. I carried out the line simplification by adding each polygon to CGAL::Constrained_triangulation_plus_2<CDT> ct and then running CGAL::Polyline_simplification_2::simplify(ct, Cost(), Stop(0.5)); . The outer boundaries will get simplified but the inner/shared boundaries (between provinces)

CGAL draw function is giving 'CGAL_USE_BASIC_VIEWER is not defined' error in Visual Studio

做~自己de王妃 提交于 2021-01-28 08:40:28
问题 I am trying to generate mesh and 3D object from point cloud. I have searched lots of libraries and I decided to use CGAL. I followed this youtube tutorial. Due to the fact that I want to see the objects, I need to use Qt5 library (as mentioned here) and I downloaded it. And it worked as in tutorial. Libraries and applications I've used CMake 3.15.3 CGAL-4.13.1 Qt 5.13.0 Boost 1_71_0 The problem is that when I call the CGAL::draw() function it gives me this error Impossible to draw because

Retrieve z from a constrained delaunay triangulation of Projection_traits_xy_3

做~自己de王妃 提交于 2021-01-28 07:08:03
问题 Given x,y , how can I retrieve the z coordinate of a 2D constrained delaunay triangulation built from 2.5D with projection_traits_xy_3 ? typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Projection_traits_xy_3<K> Gt; typedef CGAL::Triangulation_vertex_base_2<Gt> Vb; typedef CGAL::Delaunay_mesh_face_base_2<Gt> Fb; typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds; typedef CGAL::Constrained_Delaunay_triangulation_2<Gt, Tds> CDT; My guess is that I have to

CGAL 2.5D Triangulation Attach vertex info

馋奶兔 提交于 2021-01-27 18:09:13
问题 so I currently have a 2.5D Delaunay Triangulation working using this setup. typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Triangulation_euclidean_traits_xy_3<K> Gt; typedef CGAL::Delaunay_triangulation_2<Gt> Delaunay; typedef K::Point_3 Point_3; But I want to attach additional information to each vertex. I am using this setup because the 3D data is LiDAR and thus constrained. This method has worked well but I just need to attach addition information to each

How do I remove self-intersecting triangles from a 3D surface mesh?

落爺英雄遲暮 提交于 2021-01-05 09:45:07
问题 I have a CGAL surface_mesh of triangles with some self-intersecting triangles which I'm trying to remove to create a continuous 2-manifold shell, ultimately for printing. I've attempted to use remove_self_intersection() and autorefine_and_remove_self_intersections() from this answer. The first only removes a few self-intersections while the second completely removes my mesh. So, I'm trying my own approach - I'm finding the self-intersections and then attempting to delete them. I've tried

2D Delaunay triangulation in CGAL using an arbitrary plane

…衆ロ難τιáo~ 提交于 2020-12-29 07:44:21
问题 I am new to using CGAL, and I was wondering if CGAL supports 2D Delaunay triangulation of 3D points using an arbitrary plane. The example on CGAL's documentation lists only Projection_traits_xy_3<R> , Projection_traits_yz_3<R> , and Projection_traits_xz_3<R> , in other words, projection on the xy plane, the yz plane and the xz plane. Is there any way I can define an arbitrary projection plane instead of using the xy, yz and xz planes? thanks, 回答1: There is a template < class Kernel > class

ubuntu16.04+openMVG+openMVS官网案例重建

旧巷老猫 提交于 2020-10-04 10:15:20
建议挑选日期接近的博文来参考,因为不一样更新版本的源码版本遇到的问题不一样。步骤都是大概按照官网教程: 一、安装MVG 安装所依赖的库: Engine 3.2:参考 https://blog.csdn.net/zhuiqiuzhuoyue583/article/details/107233049 中安装Engine 3.2.10的部分 opencv 3.2:参考 https://blog.csdn.net/zhuiqiuzhuoyue583/article/details/88756053#t4 中安装opencv的步骤,注意里面写的是安装opencv3.1,安装时要仔细对照里面所说的每一步 QT version >= v5.4:参考: https://blog.csdn.net/zhuiqiuzhuoyue583/article/details/103329833 这里只进行了安装,没有修改系统默认的QT ceres >=1.1:参考: https://blog.csdn.net/zhuiqiuzhuoyue583/article/details/107289419 CMake 3.8: CGAL>=4.2: VCG:参考: https://blog.csdn.net/zdafei2010/article/details/77131563 这里,我下载的是 https:/

Python地理空间分析指南PDF高清完整版免费下载|百度网盘

﹥>﹥吖頭↗ 提交于 2020-08-11 10:01:30
百度云盘:Python地理空间分析指南PDF高清完整版免费下载 提取码:0e23 内容简介 用非常流行的Python语言做地理空间分析; 学习高效、易学的地理空间分析指南; 书中含有典型且非常实用的开发案例,帮助读者快速掌握相关技能; 图文结合,将学习效率大大提高。 Python作为一种高级程序设计语言,凭借其简洁、易读及可扩展性日渐成为程序设计领域备受推崇的语言之一。 本书以地理空间分析为背景,介绍了Python在地理信息处理方面的应用技巧。全书共分为10章,分别介绍了Python与地理空间分析、地理空间数据、地理空间技术、Python的地理空间分析工具、Python与地理信息系统、Python与遥感、Python与高程数据、Python与地理空间高级建模、实时数据、综合应用等内容。 本书内容结构清晰,示例完整,适合希望了解测绘数字化和分析的读者,也适合想使用Python进行空间地理分析、建模和GIS分析的开发人员及研究人员参考阅读。 作者简介 Joel Lawhead 目前是NVision公司的CIO,该公司是业内屡获殊荣的地理信息集成和传感工程服务提供商。他还获得了管理专业人员资格认证(Project Management Professional,PMP),地理信息专业资格认证(certified GIS Professional ,GISP)。