P. A krobotu , S. K itaev and Z. M asárova , On word-representability of polyomino triangulations , Siberian Adv. Math., 25 (2015) 1–10.
 Z. C hen , S. K itaev and B. Y. S un , Word-representability of face subdivisions of triangular grid graphs , Graphs Combin., 32 (2016) 1749–1761.
 Z. C hen , S. K itaev and B. Y. S un , Word-representability of triangulations of grid-covered cylinder graphs , Discrete Appl. Math., 213 (2016) 60–70.
 K. D iks , L. K owalik and M. K urowski , A new 3-color criterion for
western United States ( Dong et al., 1998 ), central west Bulgaria ( Dimitrov and Georgiev, 2011 ), Central Valley, California ( Romero and Berber, 2018 ) and so on. Global Positioning System (GPS) data provide a good opportunity to study the current geodynamic processes, but the basic question arising in this case is how far the present-day results can be extrapolated back in time. An approach to address this question is to integrate GNSS with historical triangulation data in spite of the fact that the positional accuracy of the old triangulations is usually in the
triangulation as a collective term to incorporate digital structuring, conditions and meanings of media studies of the onlife and demonstrates that the concept can be a valuable approach to methodological development in the field of social science and humanities.
Digital method triangulation is proposed to be able to include combinations of qualitative and quantitative approaches of offline and online methods as well as of big and small data. Therefore, the two types of data-driven media studies used as examples – 1) digital focus groups and 2) measurements of internet
We introduce the altitudes of a triangle (the cevians perpendicular to the opposite sides). Using the generalized Ceva’s Theorem, we prove the existence and uniqueness of the orthocenter of a triangle . Finally, we formalize in Mizar  some formulas  to calculate distance using triangulation.
triangulation in social sciences research: Can qualitative and quantitative methods be combined? Journal of Comparative Social Work 1: 1–12. Available at: http://www.jcsw.no/?page=issueContent&issue=issue04 (accessed 11 March 2014).
Ingold T., Lee J., 2008. Ways of walking: Ethnography and practice on foot . Ashgate, London.
Janarthanam S., Lemon O., Liu X., Bartie P., Mackaness W., Dalmas T., Goetze J., 2012. Integrating location, visibility, and question-answering in a spoken dialogue system for pedestrian city exploration. Paper presented at SemDial 2012
Na Li, Jiquan Yang, Aiqing Guo, Yijian Liu and Hai Liu
Applied to Spam Detection. - Knowledge Based Systems, Vol. 64, 2014, pp. 22-31.
4. Guan, M., Z. Bo. Eight Quadrants Triangulation Algorithm about Space Closed Point Cloud. - Journal of Harbin University of Science and Technology, Vol. 14, 2009, No 3, pp. 20-24.
5. Wu, R. Based on Hexagonal Grid Geometry Processing Method. Doctoral Dissertation of JI Lin University, Ji Lin China, 2007.
6. Fathi, H., F. Dai, M. Lourakis. Automated As-Built 3D Reconstruction of Civil Infrastructure Using Computer Vision: Achievements
2011, San Francisco, CA, USA, December 8-9, 2011 , pages 136–143, 2011. URL http://www.isca-speech.org/archive/iwslt_11/sltb_136.html .
Bojar, Ondřej, Zdeněk Žabokrtský, Ondřej Dušek, Petra Galuščáková, Martin Majliš, David Mareček, Jiří Maršík, Michal Novák, Martin Popel, and Aleš Tamchyna. The Joy of Parallelism with CzEng 1.0. In Proceedings of LREC2012 , Istanbul, Turkey, 2012. ELRA, European Language Resources Association.
Cohn, Trevor and Mirella Lapata. Machine Translation by Triangulation: Making Effective Use of Multi-Parallel Corpora. In ACL
Atsuhiro Nakamoto, Seiya Negami, Kyoji Ohba and Yusuke Suzuki
 K. Appel, W. Haken and J. Koch, Every planar map is four colorable, Illinois J. Math. 21 (1977) 429-567.
 J.L. Arocha, J. Bracho and V. Neumann-Lara, On the minimum size of tight hypergraphs, J. Graph Theory 16 (1992) 319-326. doi:10.1002/jgt.3190160405
 J.L. Arocha, J. Bracho and V. Neumann-Lara, Tight and untight triangulations surfaces by complete graphs, J. Combin. Theory Ser. B 63 (1995) 185-199. doi:10.1006/jctb.1995.1015
 J. Czap, S. Jendroľ, F. Kardoš and J. Miškuf
data, Proceedings 4th ISPRS Workshop on Dynamic and Multi-dimensional GIS, 2005.
23. Tsai V. J. D., Delaunay triangulations in TIN creation: an overview and a linear-time algorithm, International Journal of Geographical Information Systems, vol. 7 iss. 6, 1993, pp. 501-524, DOI 10.1080/02693799308901979.
Jorge L. Arocha, Javier Bracho, Natalia García-Colín and Isabel Hubard
The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.