CGAL users discussion list

["M. Hazegh" <>]

Thank you very much for your help. I was able to refactor the code and
make my own Delaunay_mesher_2 in my own namespace with all the
supporting classes. I am still working on implementing the
private_test_point_conflict_impl() ...

Is there a paper, technical report or a webpage that explains the
algorithm used in CGAL::refine_Delaunay_mesh_2?

On Sun, Oct 12, 2008 at 6:12 PM, Mariette Yvinec
<>
 wrote:
>
> too difficult ...
>
> on the theoretical side, our meshing algorithm requires the contrained 
> edges to be refined
> in subedges having the Gabriel property, meaning that their diametral ball 
> is empty of mesh vertices.
> This is important because it guarantees that Steiner vertices are ony 
> inserted inside
> the domain which is crucial fr termination. Your will have to drop that 
> requirement at least fro some edges.
> Therefore if you want to avoid that the meshing algorithm goes on inserting 
> Steiner vertices for ever
> furthter and further away, make sure that the domain is surrounded by a 
> bounding box
> the edges of which  will be refined  on Gabriel edges
>
> on the code sides, you will have to change several things.
> If I am right, these things will be merely
> in the class Refine_edge.h and/or  Refine_edge_base.h
> all related to test_confilct_point***** :
> no longer derive from  No_private_test_point_conflict
> add a private_test_point_conflict
> test_point_conflict_from_superior_impl
>
>
>
> M. Hazegh wrote:
>>
>> I wonder if my question was too naive or too difficult?
>>
>> On Fri, Oct 10, 2008 at 2:21 PM, M. Hazegh 
>> <>
>>  wrote:
>>
>>>
>>> Anybody can comment on this please?
>>>
>>>
>
> --
> Mariette Yvinec
> Geometrica project team
> INRIA  Sophia-Antipolis
>
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss