Subject: CGAL users discussion list
List archive
- From: Leandro Gazoni <>
- To:
- Subject: [cgal-discuss] complexity dynamic_hull_3.cpp
- Date: Thu, 10 Sep 2009 20:50:23 -0300
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=oCJGNuBIIL3vGnSDuYmsseeNMkrUPt1GIvJSxMpnFflbx6Ye4N+2d9fq6Ns8atJe8s LmS1uZyH/8CGWxgC9jl68qBzjoYSvc9ksy2+FW77LHq+Vh0JJQ3dpIBkoRSKXFDeTxpJ sit50TIjKXPJjVAFgW74tMrnNqQZw6z5YbJfM=
Dear Friends,
One question, the complexity of the algorithm in the example ConvexHull "examples/Convex_hull_3/dynamic_hull_3.cpp", where "Then the number of points of the convex hull are obtained by counting the number of triangulation vertices incident to the infinite vertex".
Can be considered O (n log n) as the problem of QuickHull?
This problem is slower than the example for QuickHull "examples/Convex_hull_3/quickhull_3.cpp" or they have the same complexity?
thank's!
--
Leandro Gazoni
- [cgal-discuss] complexity dynamic_hull_3.cpp, Leandro Gazoni, 09/11/2009
Archive powered by MHonArc 2.6.16.