{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:39Z","timestamp":1725763479246},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_2","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"11-21","source":"Crossref","is-referenced-by-count":3,"title":["Geodesic-Preserving Polygon Simplification"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Aichholzer, O., Hackl, T., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic-preserving polygon simplification. ArXiv e-prints (2013), arXiv:1309.3858"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic order types. Algorithmica (to appear, 2013)","DOI":"10.1007\/s00453-013-9818-8"},{"issue":"8","key":"2_CR3","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1016\/j.comgeo.2013.05.001","volume":"46","author":"O. Aichholzer","year":"2013","unstructured":"Aichholzer, O., Miltzow, T., Pilz, A.: Extreme point and halving edge search in abstract order types. Computational Geometry: Theory and Applications\u00a046(8), 970\u2013978 (2013)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009204","volume":"21","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Chiang, Y.-J., Held, M., Mitchell, J.S.B., Sacristan, V., Skiena, S., Yang, T.-H.: On minimum-area hulls. Algorithmica\u00a021(1), 119\u2013136 (1998)","journal-title":"Algorithmica"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Aronov, B.: On the geodesic Voronoi diagram of point sites in a simple polygon. In: SoCG, pp. 39\u201349 (1987)","DOI":"10.1145\/41958.41963"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02189321","volume":"9","author":"B. Aronov","year":"1993","unstructured":"Aronov, B., Fortune, S., Wilfong, G.T.: The furthest-site geodesic Voronoi diagram. Discrete and Computational Geometry\u00a09, 217\u2013255 (1993)","journal-title":"Discrete and Computational Geometry"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol.\u00a04, pp. 47\u2013123. World Scientific (1995)","DOI":"10.1142\/9789812831699_0003"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bose, P., Demaine, E.D., Hurtado, F., Iacono, J., Langerman, S., Morin, P.: Geodesic ham-sandwich cuts. In: SoCG, pp. 1\u20139 (2004)","DOI":"10.1145\/997817.997821"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0218195905001762","volume":"15","author":"E.D. Demaine","year":"2005","unstructured":"Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M.H., Whitesides, S.: Separating point sets in polygonal environments. International Journal of Computational Geometry and Applications\u00a015(4), 403\u2013420 (2005)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer\u00a010(2), 112\u2013122 (1973)","journal-title":"The Canadian Cartographer"},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S. Ghosh","year":"2007","unstructured":"Ghosh, S.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. Journal of Computer and System Sciences\u00a039(2), 126\u2013152 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"2_CR14","first-page":"383","volume":"3","author":"L.J. Guibas","year":"1993","unstructured":"Guibas, L.J., Hershberger, J., Mitchell, J.S.B., Snoeyink, J.: Approximating polygons and subdivisions with minimum link paths. Journal of Computer and System Sciences\u00a03(4), 383\u2013415 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gupta, H., Wenger, R.: Constructing pairwise disjoint paths with few links. ACM Transactions on Algorithms\u00a03(3) (2007)","DOI":"10.1145\/1273340.1273342"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J. Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for euclidean shortest paths in the plane. SIAM Journal of Computing\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Computational Geometry: Theory and Applications\u00a04, 63\u201397 (1994)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR18","series-title":"LNCS","first-page":"207","volume-title":"FCT 1983","author":"S. Hertel","year":"1983","unstructured":"Hertel, S., Mehlhorn, K.: Fast triangulation of simple polygons. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 207\u2013218. Springer, Heidelberg (1983)"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A.A. Melkman","year":"1987","unstructured":"Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Information Processing Letters\u00a025(1), 11\u201312 (1987)","journal-title":"Information Processing Letters"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01758836","volume":"8","author":"J.S.B. Mitchell","year":"1992","unstructured":"Mitchell, J.S.B.: L\n                  1 shortest paths among polygonal obstacles in the plane. Algorithmica\u00a08, 55\u201388 (1992)","journal-title":"Algorithmica"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, 2nd edn., pp. 607\u2013642. Chapman & Hall\/CRC (2004)","DOI":"10.1201\/9781420035315.ch27"},{"key":"2_CR22","unstructured":"Mitchell, J.S.B., Polishchuk, V., Sysikaski, M.: Minimum-link paths revisited. ArXiv e-prints (2013), arXiv:1302.3091"},{"issue":"4","key":"2_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/PL00009199","volume":"20","author":"E. Papadopoulou","year":"1998","unstructured":"Papadopoulou, E., Lee, D.T.: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains. Algorithmica\u00a020(4), 319\u2013352 (1998)","journal-title":"Algorithmica"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations\u2014a survey. In: Surveys on Discrete and Computational Geometry\u2014Twenty Years Later. Contemporary Mathematics, pp. 343\u2013410 (2008)","DOI":"10.1090\/conm\/453\/08807"},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00454-004-1091-9","volume":"33","author":"B. Speckmann","year":"2005","unstructured":"Speckmann, B., T\u00f3th, C.D.: Allocating vertex \u03c0-guards in simple polygons via pseudo-triangulations. Discrete and Computational Geometry\u00a033(2), 345\u2013364 (2005)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S. Suri","year":"1986","unstructured":"Suri, S.: A linear time algorithm for minimum link paths inside a simple polygon. Computer Vision, Graphics, and Image Processing\u00a035(1), 99\u2013110 (1986)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"issue":"2","key":"2_CR27","first-page":"9","volume":"3","author":"G.T. Toussaint","year":"1989","unstructured":"Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Revue D\u2019Intelligence Artificielle\u00a03(2), 9\u201342 (1989)","journal-title":"Revue D\u2019Intelligence Artificielle"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:30:47Z","timestamp":1558765847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}