Subject: CGAL users discussion list
List archive
- From: Manu Kaul <>
- To:
- Subject: Re: [cgal-discuss] CGAL newbie question
- Date: Mon, 10 Sep 2012 10:29:47 +0200
Thanks Monique and Olivier. Will look into the tutorials. Its just that I haven't done much generic programming either, so wondering what the
learning curve will be in that case.
On Mon, Sep 10, 2012 at 10:26 AM, Olivier Devillers <> wrote:
Le 9/9/12 8:18 AM, Manu Kaul a écrit :
Hi all,2 Triangulation of a terrain is what you need:
I used the "Triangle" library from http://www.cs.cmu.edu/~quake/triangle.html <http://www.cs.cmu.edu/%7Equake/triangle.html> by Jonathan Shewchuck to generate a Delaunay triangulationso that I can feed it to a "Chen and Han" shortest path implementation by O'Rourke (http://cs.smith.edu/~orourke/ShortestPaths/ <http://cs.smith.edu/%7Eorourke/ShortestPaths/>)
of my raw x,y,z points. I am trying to create an indexing structure and some distance bounds that make the shortest path calculation on a
terrain faster + some other queries like range queries, and k-nearest neighbour queries as well.
I noticed that in order to do some of these things I might need CGAL, but I understand that the learning curve can be quite steep.
The things I need to do are :
1. Generate TINs at multiple levels of details by introducing Steiner points.
2. Being able to access the triangles and its adjacent triangles in raw form (like 0 1 2 vertices of triangle in counter-clockwise format)
3. Have the ability to compute the slope of each triangle and also all its interior angles.
4. Need to be able to *project* onto the terrain the 3D euclidean line between any two points of the terrain.
5. Generate a Voronoi diagram from the Delaunay (Triangle generates this too)
http://www.cgal.org/Manual/beta/doc_html/cgal_manual/Triangulation_2/Chapter_main.html#Subsection_37.5.2
4 The triangles intersected by the vertical projection of a line on the terrain are given by
http://www.cgal.org/Manual/beta/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html#Nested_type_Line_face_circulator
5 use "dual" fonctions of vertices and faces
3 are just basic computations
1 you have to manage levels of details yourself. CGAL triangulation supports insertion and deletions.
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss
--
The greater danger for most of us lies not in setting our aim too high and falling short; but in setting our aim too low, and achieving our mark.
- Michelangelo
- [cgal-discuss] CGAL newbie question, Manu Kaul, 09/09/2012
- Re: [cgal-discuss] CGAL newbie question, Monique Teillaud, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Olivier Devillers, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Manu Kaul, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Monique Teillaud, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Manu Kaul, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Philipp Moeller, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Olivier Devillers, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Manu Kaul, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Manu Kaul, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Monique Teillaud, 09/10/2012
- Re: [cgal-discuss] CGAL newbie question, Manu Kaul, 09/10/2012
Archive powered by MHonArc 2.6.18.