cgal

Compiling a basic CGAL program in C++ on Mac OS X 10.7.2

六月ゝ 毕业季﹏ 提交于 2019-11-30 18:39:57
问题 When I tried to compile Voronoi_Diagram_2 example I am getting this output: singhg@~/Programming/examples/Voronoi_diagram_2 $ cmake -DCGAL_DIR=/opt/local/lib/cmake/ CMake Error at CMakeLists.txt:20 (include): include could not find load file: /opt/local//opt/local/lib/cmake/UseCGAL.cmake CMake Error at CMakeLists.txt:22 (include): include could not find load file: CGAL_CreateSingleSourceCGALProgram CMake Error at CMakeLists.txt:26 (create_single_source_cgal_program): Unknown CMake command

What's a good library to do computational geometry (like CGAL) in a garbage-collected language?

主宰稳场 提交于 2019-11-30 12:31:56
I need a library to handle computational geometry in a project, especially boolean operations, but just about every feature is useful. The best library I can find for this is CGAL , but this is the sort of project I would hesitate to make without garbage collection. What language/library pairs can you recommend? So far my best bet is importing CGAL into D. There is also a project for making Python bindings for CGAL, but it's very incomplete. I would still recommend to proceed with Python and the existing Python binding. When you find it's incomplete, you'll also find that it is fairly easy to

CGAL - Retrieve Vertex Index After Delaunay Triangulation

二次信任 提交于 2019-11-29 00:16:08
I am computing the 2D delaunay triangulation of a few thousand points. Each point has more data associated with it beyond x and y coordinates. Therefore, I was wondering if it is possible to retrieve the index of each point so that I can access my own point struct in another vector. Currently, as I access vertices from a Face_handle, it returns a point (i.e. x,y coordinates) How can I return each vertex by its ID (index) instead of its x,y coordinates? Thank you. #include <vector> #include <CGAL/Exact_predicates_inexact_constructions_kernel.h> #include <CGAL/Delaunay_triangulation_2.h> typedef

CGAL 2D Delaunay Triangulation: How to get edges as vertex id pairs

女生的网名这么多〃 提交于 2019-11-28 10:16:05
I have a set of 2D points each with an associated id. (e.g. if the points are stored in an array, the id is the index into each point 0,....,n-1 ). Now I create a Delaunay triangulation of these points and want to list down all the finite edges. For each edge, I would like to have the ids of the points represented by corresponding 2 vertices. Example: if there's an edge between point 0 and point 2 then (0,2). Is this possible? #include <vector> #include <CGAL\Exact_predicates_inexact_constructions_kernel.h> #include <CGAL\Delaunay_triangulation_2.h> typedef CGAL::Exact_predicates_inexact

CGAL - Retrieve Vertex Index After Delaunay Triangulation

≡放荡痞女 提交于 2019-11-27 14:09:40
问题 I am computing the 2D delaunay triangulation of a few thousand points. Each point has more data associated with it beyond x and y coordinates. Therefore, I was wondering if it is possible to retrieve the index of each point so that I can access my own point struct in another vector. Currently, as I access vertices from a Face_handle, it returns a point (i.e. x,y coordinates) How can I return each vertex by its ID (index) instead of its x,y coordinates? Thank you. #include <vector> #include

Compiling a static executable with CMake

♀尐吖头ヾ 提交于 2019-11-27 12:51:51
for a project I need to create an executable that includes all the libraries that I used (opencv, cgal) in order to execute it on a computer that has not those libraries. Currently, this is my CMakeLists.txt (I use linux). cmake_minimum_required(VERSION 2.8) #set(CMAKE_CXX_FLAGS_DEBUG "${CMAKE_CXX_FLAGS_DEBUG} -Wall") set(CMAKE_CXX_FLAGS_RELEASE "${CMAKE_CXX_FLAGS_RELEASE} -Wall -O2") project( labeling ) set(CMAKE_FIND_LIBRARY_SUFFIXES ".a") add_library(OpenCV STATIC IMPORTED) add_library(CGAL STATIC IMPORTED COMPONENTS Core) add_library(GMP STATIC IMPORTED) find_package(OpenCV REQUIRED) find

Visual C++: How to disable specific linker warnings?

谁都会走 提交于 2019-11-27 06:46:33
I'm using a library from CGAL which during the linking stage of my code compilation produces a lot of linking warnings of this form: warning LNK4099: PDB 'vc80.pdb' was not found with 'gmp-vc80-mt-sgd.lib' or at 'vc80.pdb'; linking object as if no debug info How do I turn off this specific linker warning under Visual C++/Studio 2008? Note that I do not have any control on the external (CGAL) library which I am using. I cannot/donot want to get into recompiling the external library. Hence, the need to fix the messages at my end. Aaron Saarela Add the following as a additional linker option:

Polygon Triangulation with Holes

一笑奈何 提交于 2019-11-27 06:08:54
I am looking for an algorithm or library (better) to break down a polygon into triangles. I will be using these triangles in a Direct3D application. What are the best available options? Here is what I have found so far: Ben Discoe's notes FIST: Fast Industrial-Strength Triangulation of Polygons I know that CGAL provides triangulation but am not sure if it supports holes. I would really appreciate some opinions from people with prior experience in this area. Edit: This is a 2D polygon. Jonathan Shewchuk's Triangle library is phenomenal; I've used it for automating triangulation in the past. You

CGAL 2D Delaunay Triangulation: How to get edges as vertex id pairs

回眸只為那壹抹淺笑 提交于 2019-11-27 03:37:07
问题 I have a set of 2D points each with an associated id. (e.g. if the points are stored in an array, the id is the index into each point 0,....,n-1 ). Now I create a Delaunay triangulation of these points and want to list down all the finite edges. For each edge, I would like to have the ids of the points represented by corresponding 2 vertices. Example: if there's an edge between point 0 and point 2 then (0,2). Is this possible? #include <vector> #include <CGAL\Exact_predicates_inexact

Lightweight Delaunay trianguation library (for c++) [closed]

旧街凉风 提交于 2019-11-27 01:33:29
问题 I'd like to play around with some (2D) Delaunay triangulations, and am looking for a reasonably small library to work with. I'm aware of CGAL, but I was wondering if there was something fairly simple and straightforward out there. Things I would like to do: create a triangulation of an arbitrary set of points find triangle an arbitrary point is in, and fetch the vertices create an image of the triangulation (optional) Suggestions? 回答1: You should probably detail your goals a bit, so that more