mirror of https://github.com/CGAL/cgal
3a223ebd1e
|
||
|---|---|---|
| .. | ||
| CMakeLists.txt | ||
| README | ||
| adding_handles_3.cpp | ||
| color.cpp | ||
| copy_triangulation_3.cpp | ||
| draw_triangulation_3.cpp | ||
| fast_location_3.cpp | ||
| find_conflicts_3.cpp | ||
| for_loop.cpp | ||
| info_insert_with_pair_iterator.cpp | ||
| info_insert_with_pair_iterator_regular.cpp | ||
| info_insert_with_transform_iterator.cpp | ||
| info_insert_with_zip_iterator.cpp | ||
| parallel_insertion_and_removal_in_regular_3.cpp | ||
| parallel_insertion_in_delaunay_3.cpp | ||
| regular_3.cpp | ||
| regular_with_info_3.cpp | ||
| segment_cell_traverser_3.cpp | ||
| segment_simplex_traverser_3.cpp | ||
| sequential_parallel.cpp | ||
| simple_triangulation_3.cpp | ||
| simplex.cpp | ||
README
------- simple_triangulation_3 ----------------------------------------------- This example shows the incremental construction of a 3D triangulation, the location of a point, and how to manipulate elementary operations on indices in a cell. It uses the default parameters proposed by CGAL for the Triangulation_3 class. ------- color ------------------------------------------------ This example shows how the user can plug his own vertex base in a triangulation. ------- adding_handles_3 --------------------------------------- This example shows how the user can plug his own vertex base in a triangulation, when he needs to add handles in it. ------- fast_location_3 -------------------------------------------- This example shows the use of the Fast_location policy to speed up point location queries in a Delaunay triangulation. ------- segment_traverser_3 -------------------------------------------- This example shows how to use a Triangulation_segment_cell_iterator_3 to traverse the triangulation in a straight line. ------- tds -------------------------------------------------- Shows how to construct a 3D triangulation data structure by inserting vertices. ------- find_conflicts_3 --------------------------------------- Illustrates how the insertion process of points in a Delaunay triangulation can be decomposed in order to give access to the cells in conflict (those which would be destroyed by the insertion of a point) prior to deciding to do the actual insertion or not. ------- linking_2d_and_3d ------------------------------------ Illustrates how to setup a 2D and a 3D triangulation data structure whose vertices respectively store vertex handles of the other one. ------- regular_3 ---------------------------------------------- Illustrates the use of Regular_triangulation_3. ------- simplex ---------------------------------------------- Illustrates the use of Triangulation_3::Simplex.