{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:24Z","timestamp":1725549504937},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_25","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:40:30Z","timestamp":1268383230000},"page":"299-310","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Weight Pseudo-Triangulations"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Aichholzer, O., Orden, D., Santos, F., Speckmann, B.: On the Number of Pseudo-Triangulations of Certain Point Sets. In: Proc. 15th Canadian Conference on Computational Geometry, pp. 141\u2013144 (2003)"},{"key":"25_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":"25_CR3","unstructured":"Basch, J., Guibas, L.J., Hershberger, J., Zhang, L.: Deformable free space tiling for kinetic collision detection. In: Proc. 4th Workshop on Algorithmic Foundations of Robotics (2000)"},{"key":"25_CR4","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.J., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica\u00a012, 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-51859-2_15","volume-title":"Proc. International Symposium on Optimal Algorithms","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Proc. International Symposium on Optimal Algorithms. LNCS, vol.\u00a0401, pp. 168\u2013192. Springer, Heidelberg (1989)"},{"key":"25_CR6","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company, New York (1979)"},{"key":"25_CR7","unstructured":"Gilbert, P.D.: New results in planar triangulations. Report R\u2013850, Univ. Illinois Coordinated Science Lab (1979)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1995.0797","volume":"23","author":"M.T. Goodrich","year":"1997","unstructured":"Goodrich, M.T., Tamassia, R.: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. Journal of Algorithms\u00a023(1), 51\u201373 (1997)","journal-title":"Journal of Algorithms"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D., Speckmann, B.: Kinetic Maintenance of Context-Sensitive Hierarchical Representations for Disjoint Simple Polygons. In: Proc. 18th ACM Symposium on Computational Geometry, pp. 179\u2013188 (2002)","DOI":"10.1145\/513400.513423"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G. Klincsek","year":"1980","unstructured":"Klincsek, G.: Minimal triangulations of polygonal domains. Annals of Discrete Math\u00a09, 121\u2013123 (1980)","journal-title":"Annals of Discrete Math"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1006\/jagm.1997.0918","volume":"27","author":"D. Krznaric","year":"1998","unstructured":"Krznaric, D., Levcopoulos, C.: Quasi-greedy triangulations approximating the minimum weight triangulation. Journal of Algorithms\u00a027(2), 303\u2013338 (1998)","journal-title":"Journal of Algorithms"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/0196-6774(87)90020-4","volume":"8","author":"D.A. Plaisted","year":"1987","unstructured":"Plaisted, D.A., Hong, J.: A heuristic triangulation algorithm. J. of Algorithms\u00a08, 405\u2013437 (1987)","journal-title":"J. of Algorithms"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vegter, G.: Pseudo-triangulations: Theory and applications. In: Proc. 12th ACM Symposium on Computational Geometry, pp. 291\u2013300 (1996)","DOI":"10.1145\/237218.237398"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M. Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Computational Geometry\u00a016(4), 419\u2013453 (1996)","journal-title":"Discrete Computational Geometry"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-45071-8_45","volume-title":"Proc. 9th Symposium on Computing an Combinatorics","author":"G. Rote","year":"2003","unstructured":"Rote, G., Wang, C.A., Wang, L., Xu, Y.: On constrained minimum pseudotriangulations. In: Proc. 9th Symposium on Computing an Combinatorics. LNCS, vol.\u00a02697, pp. 445\u2013454. Springer, Heidelberg (2003)"},{"key":"25_CR16","unstructured":"Speckmann, B., T\u00f3th, C.D.: Allocating Vertex pi-guards in Simple Polygons via Pseudo-Triangulations. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 109\u2013118 (2003)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Streinu, I.: A Combinatorial Approach to Planar Non-Colliding Robot Arm Motion Planning. In: Proc. 41st ACM Annual Symposium on Foundations of Computer Science, pp. 443\u2013453 (2000)","DOI":"10.1109\/SFCS.2000.892132"},{"key":"25_CR18","volume-title":"Display and Analysis of Spatial Data","author":"P. Yoeli","year":"1975","unstructured":"Yoeli, P.: Compilation of data for computer-assisted relief cartography. In: Davis, J., McCullagh, M. (eds.) Display and Analysis of Spatial Data. John Wiley & Sons, New York (1975)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:58:49Z","timestamp":1605743929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}