{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:23:53Z","timestamp":1725600233279},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"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-22300-6_56","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"655-666","source":"Crossref","is-referenced-by-count":1,"title":["Faster Algorithms for Minimum-Link Paths with Restricted Orientations"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Polishchuk","sequence":"first","affiliation":[]},{"given":"Mikko","family":"Sysikaski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"56_CR1","first-page":"39","volume":"4","author":"J. Adegeest","year":"1994","unstructured":"Adegeest, J., Overmars, M.H., Snoeyink, J.: Minimum-link c-oriented paths: Single-source queries. IJCGA\u00a04(1), 39\u201351 (1994)","journal-title":"IJCGA"},{"key":"56_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028268","volume-title":"Algorithms and Data Structures","author":"G. Das","year":"1991","unstructured":"Das, G., Narasimhan, G.: Geometric searching and link distance. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519. Springer, Heidelberg (1991)"},{"key":"56_CR3","first-page":"13","volume":"1","author":"M. Berg de","year":"1991","unstructured":"de Berg, M.: On rectilinear link distance. CGTA\u00a01, 13\u201334 (1991)","journal-title":"CGTA"},{"issue":"3","key":"56_CR4","first-page":"287","volume":"2","author":"M. Berg de","year":"1992","unstructured":"de Berg, M., van Kreveld, M.J., Nilsson, B.J., Overmars, M.H.: Shortest path queries in rectilinear worlds. IJCGA\u00a02(3), 287\u2013309 (1992)","journal-title":"IJCGA"},{"issue":"2","key":"56_CR5","first-page":"207","volume":"31","author":"A. Dumitrescu","year":"2004","unstructured":"Dumitrescu, A., Mitchell, J.S.B., Sharir, M.: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. DCG\u00a031(2), 207\u2013227 (2004)","journal-title":"DCG"},{"key":"56_CR6","doi-asserted-by":"crossref","unstructured":"Fitch, R., Butler, Z., Rus, D.: 3d rectilinear motion planning with minimum bend paths. In: International Conference on Intelligent Robots and Systems (2001)","DOI":"10.1109\/IROS.2001.977191"},{"key":"56_CR7","unstructured":"Goodman, J.E., O\u2019Rourke, J.: Handbook of disc. and comp. geom. CRC Press series on discrete mathematics and its applications. Chapman & Hall\/CRC (2004)"},{"key":"56_CR8","unstructured":"G\u00fcting, R.: Conquering Contours: Efficient Algorithms for Computational Geometry. PhD thesis, Fachbereich Informatik. Universit\u00e4t Dortmund (1983)"},{"issue":"2","key":"56_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0734-189X(87)80114-7","volume":"40","author":"R.H. G\u00fcting","year":"1987","unstructured":"G\u00fcting, R.H., Ottmann, T.: New algorithms for special cases of the hidden line elimination problem. Comp. Vis., Graph., Image Proc.\u00a040(2), 188\u2013204 (1987)","journal-title":"Comp. Vis., Graph., Image Proc."},{"key":"56_CR10","first-page":"63","volume":"4","author":"J. Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. CGTA\u00a04, 63\u201397 (1994)","journal-title":"CGTA"},{"key":"56_CR11","unstructured":"Hershberger, J., Suri, S.: BSP for 3d subdivisions. In: SODA 2003 (2003)"},{"issue":"2","key":"56_CR12","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H. Imai","year":"1986","unstructured":"Imai, H., Asano, T.: Efficient algorithms for geometric graph search problems. SIAM J. Comput.\u00a015(2), 478\u2013494 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"56_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(87)90024-1","volume":"8","author":"H. Imai","year":"1987","unstructured":"Imai, H., Asano, T.: Dynamic orthogonal segment intersection search. J. Algorithms\u00a08(1), 1\u201318 (1987)","journal-title":"J. Algorithms"},{"key":"56_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"D.T. Lee","year":"1996","unstructured":"Lee, D.T., Yang, C.D., Wong, C.K.: Rectilinear paths among rectilinear obstacles. Discrete Appl. Math.\u00a070, 185\u2013215 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"56_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01206332","volume":"14","author":"A. Lingas","year":"1995","unstructured":"Lingas, A., Maheshwari, A., Sack, J.-R.: Optimal parallel algorithms for rectilinear link-distance problems. Algorithmica\u00a014(3), 261\u2013289 (1995)","journal-title":"Algorithmica"},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/B978-044482537-7\/50013-9","volume-title":"Handbook of Comp. Geom.","author":"A. Maheshwari","year":"2000","unstructured":"Maheshwari, A., Sack, J.-R., Djidjev, D.: Link distance problems. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Comp. Geom., pp. 519\u2013558. Elsevier, Amsterdam (2000)"},{"key":"56_CR17","unstructured":"Mikami, K., Tabuchi, K.: A computer program for optimal routing of printed circuit conductors. In: Int. Federation Inf. Proc. Congress, pp. 1475\u20131478 (1968)"},{"key":"56_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48447-7_2","volume-title":"Algorithms and Data Structures","author":"G. Neyer","year":"1999","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 13\u201324. Springer, Heidelberg (1999)"},{"key":"56_CR19","unstructured":"Ohtsuki, T.: Gridless routers - new wire routing algorithm based on computational geometry. In: Internat. Conf. on Circuits and Systems, China (1985)"},{"issue":"1","key":"56_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0196-6774(92)90007-Y","volume":"13","author":"M. Paterson","year":"1992","unstructured":"Paterson, M., Yao, F.F.: Optimal binary space partitions for orthogonal objects. J. Algorithms\u00a013(1), 99\u2013113 (1992)","journal-title":"J. Algorithms"},{"issue":"2","key":"56_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(87)90045-9","volume":"72","author":"G.J.E. Rawlins","year":"1987","unstructured":"Rawlins, G.J.E., Wood, D.: Optimal computation of finitely oriented convex hulls. Inf. Comput.\u00a072(2), 150\u2013166 (1987)","journal-title":"Inf. Comput."},{"key":"56_CR22","unstructured":"Sato, M., Sakanaka, J., Ohtsuki, T.: A fast line-search method based on a tile plane. In: Proc. IEE ISCAS, pp. 588\u2013591 (1987)"},{"issue":"5","key":"56_CR23","first-page":"376","volume":"42","author":"D.P. Wagner","year":"2009","unstructured":"Wagner, D.P., Drysdale, R.L.S., Stein, C.: An O(n\n                2.5logn) algorithm for the rectilinear minimum link-distance problem in three dimensions. CGTA\u00a042(5), 376\u2013387 (2009)","journal-title":"CGTA"},{"issue":"4","key":"56_CR24","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1137\/0216049","volume":"16","author":"P. Widmayer","year":"1987","unstructured":"Widmayer, P., Wu, Y.-F., Wong, C.K.: On some distance problems in fixed orientations. SIAM J. Comput.\u00a016(4), 728\u2013746 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"56_CR25","first-page":"61","volume":"2","author":"C.D. Yang","year":"1992","unstructured":"Yang, C.D., Lee, D.T., Wong, C.K.: On bends and lengths of rectilinear paths: a graph theoretic approach. IJCGA\u00a02(1), 61\u201374 (1992)","journal-title":"IJCGA"},{"issue":"6","key":"56_CR26","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/12.286304","volume":"43","author":"C.D. Yang","year":"1994","unstructured":"Yang, C.D., Lee, D.T., Wong, C.K.: On bends and distances of paths among obstacles in 2-layer interconnection model. IEEE Tran. Comp.\u00a043(6), 711\u2013724 (1994)","journal-title":"IEEE Tran. Comp."},{"key":"56_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539792229672","volume":"24","author":"C.D. Yang","year":"1995","unstructured":"Yang, C.D., Lee, D.T., Wong, C.K.: Rectilinear paths problems among rectilinear obstacles revisited. SIAM J. Comput.\u00a024, 457\u2013472 (1995)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T07:40:26Z","timestamp":1554018026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}