Abstract
Given a set of points S in the plane, we propose a triangulation process to construct a triangulation for the set S. Triangulating scattered point-sets is a a very important problem in computational geometry; hence the importance to develop new efficient algorithms and models to triangulate point-sets. This process presents two well distinguished phases; Phase 1 begins with the construction of an auxiliar triangular grid containing all the points. This auxiliar mesh will help us in the triangulation process, since we take this mesh as a reference to determine the points that may be joined by edges to construct triangles that will constitute the triangulation. Phase 2 takes as a starting point the auxiliar triangular mesh obtained in Phase 1. The objective now is to determine which of the vertices of the initial set S must be joined to form the triangles that will constitute the triangulation of the points. Some examples are shown in detail to understand the behaviour of the triangulation process.
Partially supported by University of Alicante grant GRE10-34 and Generalitat Valenciana grant GV/2012/111.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Briechle, K., Hanebeck, U.: Localization of a mobile robot using relative bearing measurements. IEEE Transactions on Robotics and Automation 20(1), 36–44 (2004)
Byröd, M., Josephson, K., Åström, K.: Fast optimal three view triangulation. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds.) ACCV 2007, Part II. LNCS, vol. 4844, pp. 549–559. Springer, Heidelberg (2007)
Carmichael, G.: A survey of Delaunay Triangulations: Algorithms and Applications (2008)
Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., Teillaud, M.: Splitting a Delaunay triangulation in linear time. Algorithmica 34, 39–46 (2002)
Cohen, C., Koss, F.: A comprehensive study of three object triangulation. Mobile Robots VII 1831, 95–106 (1993)
Delaunay, B.: Sur la sphere vide. Bull. Acad. Sci. USSR VII: Class. Scil., Mat. Nat., 793–800 (1934)
Devillers, O., Pion, S., Teillaud, M.: Walking in a Triangulation. International J. Found. Comput. Science 13, 181–199 (2002)
Ely, J.L., Leclerc, A.P.: Correct Delaunay triangulation in the presence of inexact inputs and arithmetic. Reliable Computing 6, 23–38 (2000)
Esteves, J., Carvalho, A., Couto, C.: Position and orientation errors in mobile robot absolute self-localization using an improved version of the generalized geometric triangulation algorithm. In: IEEE International Conference on Industrial Technology (ICIT), pp. 830–835 (2006)
Font-Llagunes, J., Batlle, J.: Consistent triangulation for mobile robot localization using discontinuous angular measurements. Robotics and Autonomous Systems 57(9), 931–942 (2009)
Khanban, A.A., Edalat, A.: Computing Delaunay triangulation with imprecise input data. In: Proc. 15th Canadian Conference Computer Geom., pp. 94–97 (2003)
Lischinski, D.: Incremental Delaunay Triangulation. Graphic Gems IV (1994)
Loera, J.A.: Triangulations: Structures and Algorithms. In: Mark de Berg, O.C. (ed.) Computational Geometry: Algorithms and Applications. Springer (2008)
Miles, M., Huberman, A.: Qualitative Data Analysis: An Expanded Sourcebook, Thousand Oaks. Sage Publications, California (1994)
Nordberg, K.: The Triangulation Tensor. Computer Vision and Image Understanding 113, 935–945 (2009)
Sharir, M., Welzl, E.: Random triangulations of planar point sets. In: 22nd Annual Symposium on Computational Geometry, pp. 273–281. ACM (2006)
Silveira, R.I.: Optimization of polyhedral terrains. Ph.D. Thesis, Utrecht University (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Agryzkov, T., Oliver, J.L., Tortosa, L., Vicent, J.F. (2014). A Method to Triangulate a Set of Points in the Plane. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-09129-7_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09128-0
Online ISBN: 978-3-319-09129-7
eBook Packages: Computer ScienceComputer Science (R0)