十年磨一剑

Recently, i have read a paper named "as rigid as possible surface modeling", when I turned to its project web page, the author told us it had been implemented in CGAL. So with having a try mind, I dec

Based on previous blog:http://blog.youkuaiyun.com/seamanj/article/details/50616654,  1.  download CGAL4.7  https://github.com/CGAL/cgal/releases/tag/releases/CGAL-4.7 CGAL-4.7-Setup.exe 2. i

location: CGAL\boost\graph\Euler_operations.h http://doc.cgal.org/latest/BGL/group__PkgBGLEulerOperations.html#ga585a3324ef493cc1340da5cb364b772c /** * joins the two vertices incident to `h`, (

location:  CGAL\boost\graph\Euler_operations.h http://doc.cgal.org/latest/BGL/group__PkgBGLEulerOperations.html#gacfae7ff8e782da55b941e4487e86c738 /** * removes the incident face of `h` and

namespace EulerImpl { template typename boost::graph_traits::halfedge_descriptor join_face(typename boost::graph_traits::halfedge_descriptor h, Graph& g) { typedef typename boost::graph_tr

#include #include #include #include typedef CGAL::Simple_cartesian K; typedef CGAL::Surface_mesh Mesh; typedef Mesh::Vertex_index vertex_descriptor; typedef Mesh::Face_index face_descriptor; in

http://doc.cgal.org/latest/BGL/group__PkgBGLIterators.html#ga7746cb7b28520877375dfff6ec7bd32c For Surface_mesh, see http://doc.cgal.org/latest/Surface_mesh/index.html#Chapter_3D_Surface

http://doc.cgal.org/latest/Polyhedron/classCGAL_1_1Polyhedron__3_1_1Vertex.html

location:  CGAL\boost\graph /** * collapses an edge in a graph. * * \tparam Graph must be a model of `MutableFaceGraph` * Let `v0` and `v1` be the source and target vertices, and let `e` and

Here, I would like to derive the formula (10) For triangle vjvivmv_jv_iv_m, we have the following three equation which is related to viv_iwij∥(v′i−v′j)−Ri(vi−vj)∥2w_{ij}\|(v'_i-v'_j)-R_i(v_i-v_j)\|^

Graph Concepts The heart of the Boost Graph Library (BGL) is the interface, or concepts (in the parlance of generic programming), that define how a graph can be examined and manipulated in a data-str

Point& p = spMyPolyhedron->vertex_point_map[*vb]; glm::vec4 point = ctm * glm::vec4(p.x(), p.y(), p.z(), 1.f ); p = Point(point.x, point.y, point.z);

1. download the installation program from https://github.com/CGAL/cgal/releases/tag/releases/CGAL-4.7 here, i choose CGAL-4.7.zip 2. then extract to somewhere(here, I extract them to /opt s

#------------------------------------------------- # # Project created by QtCreator 2016-01-04T15:08:40 # #------------------------------------------------- QT += core gui opengl xml C

1.把教程里面的代码copy进去 #include #include typedef CGAL::Simple_cartesian Kernel; typedef Kernel::Point_2 Point_2; typedef Kernel::Segment_2 Segment_2; int main() { Point_2 p(1,1), q(10,10); std::cout

CGAL虽然配置看上去不很难,但是由于集成了很多库,所以第一次配置前前后后花了我差不多两天的时间 1.去官网下载安装程序 https://github.com/CGAL/cgal/releases/tag/releases/CGAL-4.7 CGAL-4.7-Setup.exe 2.这里我选择32位的版本,安装完后,最后有个提示 把这个目录增加到PATH里面 3

here we use example/surface_modeling/all_roi_assign_example.cpp as an example first we need to add some including directories: then we also need to add some library directories:

when you create a new project, don't forget to add the following sentence in .pro file LIBS += -lCGAL -lCGAL_Core it will  remind the system to link CGAL library. TEMPLATE = app CONFIG +

#include #include #include #include #include // Polyhedron #include #include #include #include // Graph traits adaptors #include typed

#include #include #include #include #include #include #include typedef CGAL::Simple_cartesiandouble> Kernel; typedef Kernel::Vector_3

In many papers(such as [1], [2]), we need to solve the polar decomposition of a matrix which decompose a matrix A into a rotation matrix R and a symmetric matrix S, s.t. A = RS Here, we will be u

将QT5_DIR 设置为/Users/xxx/Qt/5.10.0/clang_64/lib/cmake/Qt5