In this paper we describe a method for directly generating triangle strips from unstructured point clouds based on onion peeling triangulation (OPT). It is an iterative reconstruction of the convex hulls of point clouds in the 2D plane, and it uses pairs of subsequent layers to establish triangle strips. We compare the obtained triangulations with the results of Delaunay triangulations in terms of the distribution of the symmetry of obtained triangles and in regard to the number of polygons/vertices emitted. Our initial results show that onion peeling is a straightforward method to directly obtain large triangle strips of point clouds. As expected, the triangulation is not as well behaved as in Delaunay-triangulation [VK07]. In terms of triangle complexity and average strip length OPT is a very favorable triangulation alternative which also lends suitable for the triangulation of 3D point clouds.
[1]
Ivana Kolingerová,et al.
Comparison of triangle strips algorithms
,
2007,
Comput. Graph..
[2]
Godfried T. Toussaint,et al.
NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICE
,
1986
.
[3]
Steven Skiena,et al.
Hamiltonian triangulations for fast rendering
,
1996,
The Visual Computer.
[4]
Steven Skiena,et al.
Hamilton Triangulations for Fast Rendering
,
1994,
ESA.
[5]
Tamy Boubekeur,et al.
Surfel Stripping
,
2005,
GRAPHITE.
[6]
Bernard Chazelle,et al.
On the convex layers of a planar set
,
1985,
IEEE Trans. Inf. Theory.
[7]
G. Toussaint.
Solving geometric problems with the rotating calipers
,
1983
.
[8]
David Eppstein,et al.
Single-strip triangulation of manifolds with arbitrary topology
,
2004,
SCG '04.