{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:47:10Z","timestamp":1743140830027,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219306"},{"type":"electronic","value":"9783642219313"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21931-3_3","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T14:11:35Z","timestamp":1308319895000},"page":"30-43","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Pseudo-triangulation by Incremental Insertion"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Kolingerov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Tr\u010dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Hobza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H., Speckmann, B.: Convexity minimizes pseudo-triangulations. In: Proceedings of the 14th Canadian Conference on Computational Geometry, pp. 158\u2013162 (2002)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-45078-8_33","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The Zigzag Path of a Pseudo-Triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 377\u2013388. Springer, Heidelberg (2003)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1137\/S0097539702411368","volume":"32","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H., Brass, P.: Pseudo-triangulations from surfaces and novel type of edge flip. SIAM Journal on Computing\u00a032, 1621\u20131653 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/050631008","volume":"36","author":"H. Br\u00f6nnimann","year":"2007","unstructured":"Br\u00f6nnimann, H., Kettner, L., Pocchiola, M., Snoeyink, J.: Counting and enumerating pseudo-triangulations with greedy flip algorithm. SIAM Journal on Computing\u00a036, 721\u2013739 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica\u00a012, 54\u201368 (1994)","journal-title":"Algorithmica"},{"issue":"1-2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(02)00126-8","volume":"25","author":"L. Kettner","year":"2003","unstructured":"Kettner, L., Kirkpatrick, D., Mantler, A., Snoeyink, J., Speckmann, B., Takeuchi, F.: Tight degree bounds for pseudo-triangulations of points. Computational Geometry - Theory and Applications\u00a025(1-2), 3\u201312 (2003)","journal-title":"Computational Geometry - Theory and Applications"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D., Snoeyink, J., Speckmann, B.: Kinetic collision detection for simple polygons. In: Proceedings of the 16th ACM Symposium on Computational Geometry, pp. 322\u2013330 (2000)","DOI":"10.1145\/336154.336219"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-47738-1_21","volume-title":"Discrete and Computational Geometry","author":"D. Kirkpatrick","year":"2001","unstructured":"Kirkpatrick, D., Speckmann, B.: Separation sensitive kinetic separation structures for convex polygons. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol.\u00a02098, pp. 222\u2013236. Springer, Heidelberg (2001)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kolingerov\u00e1, I., Tr\u010dka, J., \u017dalik, B.: The stochastic walk algorithms for point location in pseudo-triangulations (2011) (manuscript)","DOI":"10.1016\/j.advengsoft.2011.04.006"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"M\u0171cke, E.P., Saias, I., Zhu, B.: Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. In: Proceedings of the 12th Annual Symposium on Computational Geometry, pp. 274\u2013283 (1996)","DOI":"10.1145\/237218.237396"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vertger, G.: Computing the visibility graph via pseudo-triangulations. In: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, pp. 248\u2013257 (1995)","DOI":"10.1145\/220279.220306"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vertger, G.: The visibility complex. Proceedings of the International Journal of Computational Geometry and Applications, 279\u2013308 (1996)","DOI":"10.1142\/S0218195996000204"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vertger, G.: Pseudo-triangulations: theory and applications. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pp. 291\u2013300 (1996)","DOI":"10.1145\/237218.237398"},{"key":"3_CR14","unstructured":"Randall, D., Rote, G., Santos, F., Snoeyink, J.: Counting triangulations and pseudo-triangulations of wheels. In: Proceedings of the 13th Canadian Conference on Computational Geometry, pp. 149\u2013152 (2001)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-45071-8_45","volume-title":"Computing and Combinatorics","author":"G. Rote","year":"2003","unstructured":"Rote, G., Wang, C.A., Wang, L., Xu, Y.: On constrained minimum pseudotriangulations. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 445\u2013454. Springer, Heidelberg (2003)"},{"key":"3_CR16","unstructured":"Speckmann, B., T\u00f3th, C.D.: Allocating vertex \u03c0-guards in simple polygons via pseudo-triangulations. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 109\u2013118 (2003)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A combinatorical approach to planar non-colliding robot arm motion planning. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pp. 443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21931-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T17:00:01Z","timestamp":1560272401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21931-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219306","9783642219313"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21931-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}