Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Using Spatial Search (Kd-tree) to find segment-mesh intersection

Subject: CGAL users discussion list

List archive

[cgal-discuss] Using Spatial Search (Kd-tree) to find segment-mesh intersection


Chronological Thread 
  • From: Edson Tadeu <>
  • To:
  • Subject: [cgal-discuss] Using Spatial Search (Kd-tree) to find segment-mesh intersection
  • Date: Mon, 30 Mar 2009 15:17:56 -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=Toy0fkGeUCsroWVwc0/MC8tB/84I9eTeE55H3X3QLh4B9WEFUWhDl8e7b9yHKqdlnW 3Z8429YOALV0jRmhfNC2DWd2uULsfKzdYwYzs1wGMWIJdX/fxkVKwkWHNxECuzhRmYAg gtSFA5NRUGzTuRUKW9c5UX+5r2Sy4vUr9Umcw=

Can CGAL Kd-tree (Spatial Search) be used to find the intersection between a line segment (or ray) and a mesh composed of 3D triangles?

Like in: http://www.cs.uoi.gr/~fudos/grad-exer1/doc/a00045.html (asr::KDTree::intersect)

Thanks,
  Edson




Archive powered by MHonArc 2.6.16.

Top of Page