Subject: CGAL users discussion list
List archive
- From: Edoardo Milotti <>
- To:
- Subject: [cgal-discuss] triangulation with info
- Date: Thu, 26 Oct 2017 09:35:50 +0200
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:DDf7phK4LXGiEOHIAtmcpTZWNBhigK39O0sv0rFitYgXLPXxwZ3uMQTl6Ol3ixeRBMOAtKIC1rKempujcFJDyK7JiGoFfp1IWk1NouQttCtkPvS4D1bmJuXhdS0wEZcKflZk+3amLRodQ56mNBWB6kG1uDUdExG6OQtuLfnuAabTid623qa84c79eQJN0RexZrpoIBL+iATVsdUKgMM2J6o2wwHFpT1NeuBR2X9pDU6I2Rf66MH2/YI1oHcYgO4o68MVCfayRK8/V7ENVDk=
A few years ago CGAL did not have the built-in capability of including additional information in triangulations, and I implemented a triangulation with additional information using the advice given in this post
Recently I noticed that the efficiency of the program that contains this method is greatly reduced after executing it: the program starts with several active threads, but it collapses to just one thread after execution of the method.
Newer CGAL versions contain the method Triangulation_vertex_base_with_info_2, and I wonder whether using it to substitute the old code could solve the efficiency problem. Can anyone give me any useful hint?
Thank you, Edoardo Milotti
- [cgal-discuss] triangulation with info, Edoardo Milotti, 10/26/2017
Archive powered by MHonArc 2.6.18.