When in release it crashes with an unhandled exception: std::length error. The call stack looks like this: msvcr90.dll!__set_flsgetvalue() Line 256 + 0xc bytes C msvcr90.dll!__set_flsgetvalue() Line 256 + 0xc bytes C msvcr90.dll!_getptd_noexit() Line 616 + 0x7 bytes C msvcr90.dll!_getptd() Line 641 + 0x5 bytes C msvcr90.dll!ra...
I found the Computational Geometry Algorithms Library in my search for an algorithm to decompose a concave polygon into the minimum number of convex components. Links off the site and numerous google results indicate there are python bindings for it, which would be really handy, but all the links are dead! What happened to it? Where c...
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 ...
When I execute my C++ code (which uses the CGAL library) under debug mode, I see a lot of debug messages in the Output window about a first-chance exception CGAL::Uncertain_conversion_exception. I am aware of what a first-chance exception is. Now, how do I turn off the display of debug messages for this one kind of exception (CGAL::Unce...
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? ...
How do I generate a transformation matrix for rotating points/others by the angle between two lines/vectors/directions in CGAL? 2D is what I need. 3D is what I love. ...
How can I use an inherited class of a triangulation in the context of a triangulation in CGAL? Basically I have the following code: typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Triangulation_vertex_base_with_info_2<int,K> Vb; typedef CGAL::Triangulation_face_base_with_info_2<int,K> Fb; typedef CGAL::T...
Hi all, The result of my Delaunay triangulation on 1000 unifomally random points doens't look right at all (see image). Some points seem to belong an abnormally high number of triangles... Any idea? Thanks Detail: CGAL 3.4, windows XP This is the types I used: typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typ...
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 arbitra...
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 i...
Hello, I am not sure whether there is a .Net version of CGAL? The last time I check there is only one CGAL equivalent in garbage-collected language. If would be tremendously helpful if we have CGAL.net. P/S: I know I can use interop, but still, a full managed version would be better. ...
Hi, I am currently getting into CGAL for some 2D triangulation tasks and I also got something simple to work allready. Anyhow I dont really get how to triangulate concave shapes since Right now I always get the convex hull of all points. Basically I want to add points on mouseClick similar to how it works in illustrator so that all the ...
I am trying to use CGAL to do some Delaunay triangulation. I used one of the CGAL samples to compute a triangulation which includes a height field attribute. The problem I have having is that I have no idea how to get the resulting triangulation. I figured out how to get the face_iterator, but I don't know what to do from there. What...
I need to represent a planar graph structure, i.e., a division of part of the plane into polygons so that I can easily find a polygon's neighbors etc (like on a map). What is the best library to use? ArcObjects? CGAL (2D arrangements)? Anything else? I use C++ under Windows. ...
I'm installing CGAL 3.5.1. To compile any part of it, I need CGAL/compiler_config.h, which, according to the manual, I have to generate by running cmake. Do I really need to download and run cmake, or is there a simpler way? I'm using Visual Studio 2005 on x64 Windows. So maybe I can download a ready config for this combination, or read...
Here is some code: struct K : CGAL::Exact_predicates_inexact_constructions_kernel {}; typedef CGAL::Triangulation_vertex_base_2<K> Vb; typedef CGAL::Constrained_triangulation_face_base_2<K> Fb; typedef CGAL::Triangulation_data_structure_2<Vb,Fb> TDS; typedef CGAL::Exact_predicates_tag It...
I would like to use a custom Point class with the CGAL constrained delaunay triangulation. However, with the following MyPoint class (which should behave the exact same as a CGAL::Point_2 no?) I get segmentation faults. It works perfectly if I set the Point_2 typedef inside MyKernel to CGAL::Exact_predicates_inexact_constructions_kernel:...
Using the Python bindings for CGAL, I can't work out how create a hexahedron, nor how to calculate its intersection with another hexahedron. I have 8 input points, which are the corners of the hexahedron: My code does this: P = Polyhedron_3() bottom = P.make_tetrahedron(p[0],p[1],p[2],p[3]) top = P.make_tetrahedron(p[4],p[5],p[6],p[...
I can only find the suitable traits with line segments(Arr_segment_traits_2), but the duality of point is a line, do I have to compute the intersection of lines in the dual plane by myself? Is there exists an approach to directly construct arrangement with the dual of a point set? ...
Hello, I am trying to learn how to use half-edge data structures in CGAL, and I am confused by the following sample of code provided on their website #include <CGAL/HalfedgeDS_default.h> #include <CGAL/HalfedgeDS_decorator.h> struct Traits { typedef int Point_2; }; typedef CGAL_HALFEDGEDS_DEFAULT<Traits> HDS; typedef CGAL::HalfedgeDS...