songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
70,101 Commits 3 Branches 156 Tags 959 MiB
Commit Graph

24 Commits

Author SHA1 Message Date
Jane Tournois c7fcdc1d08 fix the edge - facet - vertex case 2016-12-02 11:43:13 +01:00
Jane Tournois 76f729ad16 fix the degenerate case where query is collinear with facet 
when the query segment goes exactly through a facet, the succession of
simplices should be : edge - facet - edge

however, cell_iterator iterate over both of the cells incident to the
facet in question
so, we skip the 2nd one
 2016-12-02 10:49:07 +01:00
Jane Tournois 9e0f52546e cell_iterator may circulate around the edge we want 
before actually moving to the next cell crossed by the query segment
 2016-11-29 17:54:35 +01:00
Jane Tournois b192b27ec1 add source() and target() functions 2016-11-28 17:24:53 +01:00
Jane Tournois bb98fda6a5 rename function and complete it for facet case 2016-11-28 17:02:06 +01:00
Jane Tournois 76f067aef3 add collinearity tester 2016-11-28 16:59:02 +01:00
Jane Tournois dfd1fd025d vertex case 2016-11-28 16:42:47 +01:00
Jane Tournois a11db75c57 reorder facet case for consistency with edge case 
fix compilation, and complete secondary functions
 2016-11-28 14:45:23 +01:00
Jane Tournois a46bc3dc9b fix edge case 2016-11-28 14:13:56 +01:00
Jane Tournois 46f2f353fa facet and cell case 2016-11-28 12:18:03 +01:00
Jane Tournois f8c13bad64 vertex - edge - vertex case is a degenerate case 
add degeneracy() fonction to detect this kind of case
 2016-11-28 10:54:21 +01:00
Jane Tournois e340b38d86 rename member variables 2016-11-25 16:11:03 +01:00
Jane Tournois f0adff5f66 handle the edge case 
when the query passes exactly only an edge
 2016-11-25 16:02:08 +01:00
Jane Tournois 90c109f3ce rename function 2016-11-22 17:15:49 +01:00
Jane Tournois 99350fcefc fix end case 2016-11-22 16:39:02 +01:00
Jane Tournois 2e4a93f967 add Triangulation_segment_simplex_iterator_3 
this new iterator is similar to Triangulation_segment_cell_iterator_3,
but iterates over simplices of all dimensions instead of only cells.

if [source, target] crosses cell1, and enters cell2 via their common
vertex v,
then the iterator returns cell1, v, and cell2 successively
 2016-11-22 15:10:41 +01:00
Jane Tournois c173212124 WIP simplex iterator 2016-11-08 15:43:24 +01:00
Jane Tournois 24e26634f5 remove useless Dummy_gt 2016-11-08 15:12:57 +01:00
Jane Tournois 8b68ab3459 remove random generator 2016-11-08 15:06:57 +01:00
Jane Tournois 6afd0fc72a remove the extra tds constructed to store source and target as vertices 
this implies changing all `vert` containers into arrays of Point*
(instead of arrays of Vertex_handle)
 2016-11-07 15:20:06 +01:00
Thijs van Lankveld 7508c18322 Iterator pattern implemented. 2016-10-21 12:33:37 +02:00
Thijs van Lankveld ed45f5e938 Segment traverser defined as type in Triangulation_3 2016-10-21 12:33:37 +02:00
Thijs van Lankveld c3fe9652f0 First version of the segment traverser, including inclusion in the documentation. 2016-10-21 12:32:28 +02:00
Thijs van Lankveld 5640b84b2b First setup for the segment traverser small feature. 2016-10-21 12:31:05 +02:00