Abstract
The problem of faithfully matching the outlines of objects that are represented by finite point sets in 2D by simple polygons is challenging if the actual shape is non-convex and features long, straight edges and only few, distinct angles. A common application for this task is the geometric reconstruction of man-made structures like buildings from LIDAR data. Using algorithms for computing hulls to outline such point sets frequently yields polygons that consist of too many short line segments joining at unexpected angles with respect to the original object. Furthermore, if the outline polygons contain large regions that correspond to holes within the underlying object, it is desirable to represent such structures by polygons as well, but increases the complexity.
We present two methods for creating outline polygons that account for the characteristics of the aforementioned kind of objects given as finite 2D point sets, and that are also suited for bordering holes. The resulting polygons have fewer vertices and angles than those obtained from hulls and are able to depict long, straight edges of the underlying objects more accurately.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Vosselman, G.: Building reconstruction using planar faces in very high density height data. In: International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, pp. 87–92 (1999)
Moreira, A., Santos, M.Y.: Concave hull: a k-nearest neighbours approach for the computation of the region occupied by a set of points. In: Proceedings of 2nd International Conference on Computer Graphics Theory and Applications (GRAPP), pp. 61–68 (2007)
Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can. Cartogr. 10, 112–122 (1973)
Ramer, U.: An iterative procedure for the polygonal approximation of plane curves. Comput. Graph. Image Process. 1, 244–256 (1972)
Galton, A., Duckham, M.: What is the region occupied by a set of points? In: Raubal, M., Miller, H.J., Frank, A.U., Goodchild, M.F. (eds.) GIScience 2006. LNCS, vol. 4197, pp. 81–98. Springer, Heidelberg (2006). doi:10.1007/11863939_6
de Berg, M., Cheong, O., van Krevald, M., Overmars, M.: Computation Geometry, 3rd edn. Springer, Heidelberg (2008)
Edelsbrunner, H., Kirkpatrick, D., Seidel, R.: On the shape of a set of points in the plane. IEEE Trans. Inf. Theory 29, 551–559 (1983)
Duckham, M., Kulik, L., Worboys, M., Galton, A.: Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recogn. 41, 3224–3236 (2008)
Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Inf. Process. Lett. 2, 18–21 (1973)
Asaeedi, S., Didehvar, F., Mohades, A.: Alpha convex hull, a generalization of convex hull. The Computing Research Repository (CoRR) abs/1309.7829 (2013)
Wang, O., Lodha, S.K., Helmbold, D.P.: A Bayesian approach to building footprint extraction from aerial LIDAR data. In: Proceedings of 3rd International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT 2006). pp. 192–199. IEEE Computer Society, Washington, DC (2006)
Bendels, G.H., Schnabel, R., Klein, R.: Detecting holes in point set surfaces. In: Proceedings of 14th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, vol. 14 (2006)
Wang, J., Oliveira, M.M.: Filling holes on locally smooth surfaces reconstructed from point clouds. Image Vis. Comput. 25, 103–113 (2007)
Wu, X., Chen, W.: A scattered point set hole-filling method based on boundary extension and convergence. In: 11th World Congress on Intelligent Control and Automation, pp. 5329–5334. IEEE (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Feldmann, D., Pohl, M. (2017). Representing Shapes of 2D Point Sets by Straight Outlines. In: Braz, J., et al. Computer Vision, Imaging and Computer Graphics Theory and Applications. VISIGRAPP 2016. Communications in Computer and Information Science, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-64870-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-64870-5_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64869-9
Online ISBN: 978-3-319-64870-5
eBook Packages: Computer ScienceComputer Science (R0)