Subject: CGAL users discussion list
List archive
- From: Markus Eich <>
- To:
- Subject: [cgal-discuss] Surface Computation from Pointcloud
- Date: Tue, 01 Sep 2009 10:01:24 +0200
Dear all,
I want to use CGAL 3.4 in order to generate surfaces from 3D Laserscan
Pointclouds. So far I used the triangulation_hierarchy which build
tetraeder.
Basically this seems to be the right approach. The only problem is that
too many points are connected (points which are too far away. see image
with 10k points).
Is there a simple method (or a constrain for building the triangulation)
so that only the k-nearest neighbors are conntected? The pointcloud
should represent a room. The idea is to use delaunay triangulation with
region growing for 3D slam.
Cheers,
Markus
--
Dipl. Inf. Markus Eich
Researcher
Bereich Logistik
DFKI Bremen
Robotics Innovation Center
Robert-Hooke-Straße 5
28359 Bremen, Germany
Phone: +49 (0)421 218-64100
Fax: +49 (0)421 218-64150
E-Mail:
Weitere Informationen: http://www.dfki.de/robotik
-----------------------------------------------------------------------
Deutsches Forschungszentrum fuer Kuenstliche Intelligenz GmbH
Firmensitz: Trippstadter Straße 122, D-67663 Kaiserslautern
Geschaeftsfuehrung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender)
Dr. Walter Olthoff
Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes
Amtsgericht Kaiserslautern, HRB 2313
Sitz der Gesellschaft: Kaiserslautern (HRB 2313)
USt-Id.Nr.: DE 148646973
Steuernummer: 19/673/0060/3
-----------------------------------------------------------------------
- [cgal-discuss] Surface Computation from Pointcloud, Markus Eich, 09/01/2009
Archive powered by MHonArc 2.6.16.