cgal-discuss - [cgal-discuss] Complexity of Mesh_3 and AABB Tree (Big O)

Subject: CGAL users discussion list

List archive

From: Ramin H <>
To:
Subject: [cgal-discuss] Complexity of Mesh_3 and AABB Tree (Big O)
Date: Sat, 18 Jun 2011 12:51:03 -0400
Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:from:date:message-id:subject:to:content-type; b=mZqjQY2UZAZK+IkAuzDGhESA9sDrA48RwoL1tpG+sm1FdaDTzZKGnRceFyBBYD6rQh 7OclmVwqb+U9jyVFry+hfK2M1EsMAejCAP0ZVJzveRZ2OodHzIz8f5L0o2hLVrVRPB68 4sp7LiloWNi8u2be0CoUJGP1ovZwZtIZMDeKs=

Hi everyone,

I would like to know about the complexity of a few algorithms implemented in CGAL (in terms of the big-O notation).

Does anyone know what the complexity of the following algorithms are?

a) Mesh_3 algorithm: for building a mesh from a polyhedron

b) AABB Tree: for querying the intersection of a line segment with a polyhedron

Cheers,

-Ramin

[cgal-discuss] Complexity of Mesh_3 and AABB Tree (Big O), Ramin H, 06/18/2011