Subject: CGAL users discussion list
List archive
- From: Panagiotis Foteinos <>
- To:
- Subject: [cgal-discuss] 2D Triangulation Complexity
- Date: Fri, 12 Jun 2009 16:30:26 -0400
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:user-agent:mime-version:to:subject :content-type:content-transfer-encoding; b=m7fNMyoGPHChMalil2NINN7mqX0HS4ARETcxBZphmUf2QNTe4U9hzDDspetXctighU 628eLLAlTzDjKFVh366sFVXy9YsjFcBpJx54uTkEdu2RWDChU6aMUFzPGz7nuXgC8Fbk 2AzzfUpHSlSdEFEB5Mh8ie7RN53q9kMkd07l8=
Hello yall.
What is the time complexity of the
TriangulationDataStructure_2::is_face(Vertex_handle v1, Vertex_handle
v2, Vertex_handle v3, Face_handle &fr) ? Is it constant or linear with
respect to the number of faces?
Thank you in advance,
Panagiotis
- [cgal-discuss] 2D Triangulation Complexity, Panagiotis Foteinos, 06/12/2009
- Re: [cgal-discuss] 2D Triangulation Complexity, Andreas Fabri, 06/13/2009
Archive powered by MHonArc 2.6.16.