Subject: CGAL users discussion list
List archive
- From: "Tyver Ray" <>
- To:
- Subject: Constrained triangulation?
- Date: Mon, 18 Jun 2007 13:36:05 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=beta; h=received:message-id:date:from:to:subject:mime-version:content-type; b=K6vVA8bGa5ix3ZefwlKlTVjYSdAnDuATRRJy14oFSPxiPRMQIseL/ZIBfcFJsfAMd8FqbW4x0r+oSgdMvok5os8IsxWNU+3Yd7P8O2ci0vVLVKOc0x7OyDvZD/h8vDnlVFZ3IYHOAAfKB1kWvnOaQyozScmECFsb3D1kaYiynF0=
Hello experts, hello non experts!
I'm a noob...
I want to build different squares of triangulation representing a surface mesh of 1km * 1 km. These different squares will be associate to make a 10km * 10km surface mesh for instance.
-But, I don't know if I have to create constraint edges of these squares?
Could points of 2 different surface mesh of 1km*1km could be associated on the same border which separate these 2 surfaces?
-Logically I should, but how can I create square constraint segment (triangulation_2/constrained.cpp) and insert points with x, y, z in this square as it were a simple delaunay triangulation (/terrain.cpp) with the method insert ?
The problem is that in constrained.cpp, the header file allow us to use only 2D points : point().x() and point().y()
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
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 Itag;
typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, Itag> CDT;
typedef CDT::Point Point;
The terrain.cpp file allows us to use 3D points : point().x(), point().y() and point().z()
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Triangulation_euclidean_traits_xy_3.h>
#include <CGAL/Delaunay_triangulation_2.h>
struct K : CGAL::Exact_predicates_inexact_constructions_kernel {};
typedef CGAL::Triangulation_euclidean_traits_xy_3<K> Gt;
typedef CGAL::Delaunay_triangulation_2<Gt> Delaunay;
typedef K::Point_3 Point;
How could I use 3D points with Constrained_Delaunay_triangulation_2 ?
Thanks in advance!!
Tyv
- Constrained triangulation?, Tyver Ray, 06/18/2007
Archive powered by MHonArc 2.6.16.