cgal

Hey I'm a bit of a noob when it comes to CGAL and CMake but I've gotten to the point where everything seems to be running except for this link error: LINK : fatal error LNK1104: cannot open file 'libCGAL-vc120-mt-sgd-4.5.1.lib' trouble is I cant seem to find a reference to this lib anywhere am I building wrong? I can see a 'libCGAL-vc120-mt-gd-4.5.1.lib' in my cgal lib dir which links fine. I'm not sure what the difference between gd and sgd is though and how to make it. Any help is appreciated. The naming libCGAL-vc120-mt-sgd-4.5.1.lib shows that you are compiling a program, that uses CGAL,

I'm facing a problem that I hope some others have faced before because I can't find a way out ! I have a regular triangulation in CGAL in which I wish to insert some weighted points with info std::pair<myweightpoint, myinfo> one by one and to get the handle to the vertex ( Vertex_handle ) once it is inserted ! The thing is that there is no such function. It exists several functions to insert : Vertex_handle Regular_triangulation::insert ( const Weighted_point & p ) ; That returns a Vertex_handle which is cool but does not take weighted points WITH INFO which is very important for me and what I

In short, I have to generate a constrained delaunay triangulation from a set of 2D points that carry additional information. Since there could be intersecting constraints, I need that the triangulation properly interpolates the satellite data whenever it generates the new point of intersection. I tried with CGAL (C++) to define a custom kernel following the example here , but I've failed to compile it succesfully, basically because there is something fundamental of the underlying generic programming machinery of CGAL that I am missing (lot of type mismatches etc.). Can you point me to a

I am using Point Cloud Library (PCL) based C++ implementation of kd-tree nearest neighbour(NN) searching. The data set contains about 2.2 million points. I am searching NN points for every other point. The search radius is set at 2.0. To fully compute that, it takes about 12 hours! I am using windows 64 bit machine with 4GB RAM. Is it very common for kd-tree searching? I wonder if there is any other c++ library for 3D point cloud data, which is faster. I heard about ANN C++ library & CGAL, but not sure how fast these are. In short: You can only be sure if you run yourself the time measurements

OpenSCAD( http://www.openscad.org )是一个简单高效的三维建模软件，使用模型描述脚本进行建模，使用CGAL引擎进行几何体的空间布尔运算。这里介绍其源码编译方法，使用UbuntuKylin15.04. 把下面的内容存为脚本文件openscad_build.sh，修改属性为可执行，然后运行：./openscad_build.sh即可。 git clone git://github.com/openscad/openscad.git cd openscad git submodule update --init sudo ./scripts/uni-get-dependencies.sh ./scripts/check-dependencies.sh qmake openscad.pro make 如果需要安装，运行：sudo make install 有的系统上还需要安装一些其他的库，按照提示信息，使用sudo apt-get install XXX或者sudo synaptic进行安装即可。 来源： oschina 链接： https://my.oschina.net/u/2306127/blog/487291

I'm trying to make a setup.py for cgal-bindings . To install this, the user needs to have at least a certain version of CGAL. In addition, CGAL has a few optional targets that should be built if the user has some libraries (like Eigen3). Is there a cross-platform way in Python to check for this? I can use find_library in ctypes.util to check if the library exists, but I don't see any easy way to get the version . <-- This doesn't actually work all the time, some libraries are header-only like eigen3, which is a C++ template library. Using the install_requires argument of setup() only works for

I ran into an interesting issue when trying to mix clang (Apple LLVM version 6.0 (clang-600.0.56) (based on LLVM 3.5svn, Target: x86_64-apple-darwin14.0.0), c++11 and CGAL (via MacPorts). It seems that whether or not I call std::vector<>::reserve will determine whether my program will even compile. I've trimmed down the problem into a minimal example (as minimal as CGAL examples get): #include <vector> #include <CGAL/Exact_predicates_inexact_constructions_kernel.h> #include <CGAL/AABB_tree.h> #include <CGAL/AABB_traits.h> #include <CGAL/AABB_triangle_primitive.h> // CGAL::Epeck works fine,

I have never used CGAL and have got almost no C/C++ experience. But following Google I have however managed to compile the example "Alpha_shapes_3" (\CGAL-4.1-beta1\examples\Alpha_shapes_3) on a Windows 7 64bit machine using visual studio 2010. Now if we check the source code for the program "ex_alpha_shapes_3" we notice that a data file called "bunny_1000" is red where the 3d point cluster resides. Now my question is how can I change the source code so that after the alpha shape is computed for the given points, surface mesh of the alpha shape is saved/wrote in an external file. It can be

可以将文章内容翻译成中文,广告屏蔽插件可能会导致该功能失效(如失效，请关闭广告屏蔽插件后再试): 问题: I have a vector of 2D points (N elements) in the plane. I want to make the convex hull of these points. After that, I want to retrieve the vector index of each vertex in the convex hull, how can I do this? I know that, there is such possibility for triangulation by making use of vector<pair<Point_2, unsigned> > , but when I use paired point in making convex hull, it produces a bunch of errors. This is the related piece of code that I use: #include <iostream> #include <CGAL/Exact_predicates_inexact_constructions_kernel.h> #include <CGAL