{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T07:29:16Z","timestamp":1714289356781},"reference-count":85,"publisher":"Elsevier","isbn-type":[{"value":"9780444825377","type":"print"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/b978-044482537-7\/50013-9","type":"book-chapter","created":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T07:17:56Z","timestamp":1189235876000},"page":"519-558","source":"Crossref","is-referenced-by-count":12,"title":["Link Distance Problems"],"prefix":"10.1016","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[]},{"given":"Hristo N.","family":"Djidjev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0010","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S0218195994000045","article-title":"Minimum-link c-oriented paths: Single-source queries","volume":"4","author":"Adegeest","year":"1994","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0015","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0890-5401(89)90049-7","article-title":"Finding minimal convex nested polygons","volume":"83","author":"Aggarwal","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0020","article-title":"An O(n log n) algorithm for finding a shortest central link segment","author":"Aleksandrov","year":"1999","journal-title":"Internat. J. Comput. Geom. Appl"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(93)90027-4","article-title":"Minimal link visibility paths inside a simple polygon","volume":"3","author":"Alsuwaiyel","year":"1993","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"10.1016\/B978-044482537-7\/50013-9_bb0030","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(95)00072-K","article-title":"Finding an approximate minimum-link visibility path inside a simple polygon","volume":"55","author":"Alsuwaiyel","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0035","article-title":"Parallelism and greedy algorithms","author":"Anderson","year":"1984"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50013-9_bb0040","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1142\/S0218195995000234","article-title":"Logarithmic-time link path queries in a simple polygon","volume":"5","author":"Arkin","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0045","article-title":"Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values","author":"Berkman","year":"1988"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0050","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/ijoc.9.1.100","article-title":"Art gallery problems for convex nested polygons","volume":"9","author":"Bhadury","year":"1997","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0055","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jagm.1995.1033","article-title":"NC-algorithms for minimum link path and related problems","volume":"19","author":"Chandru","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0060","first-page":"339","article-title":"A theorem on polygonal cutting with application","author":"Chazelle","year":"1982"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0065","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0070","article-title":"Optimal shortest path and minimum-link path queries between two convex polygons inside a simple polygonal obstacle","author":"Chiang","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0075","series-title":"Manuscript","article-title":"Improved lower bounds for the link length of rectilinear spanning paths in grids","author":"Collins","year":"1998"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0080","first-page":"91","article-title":"Some NP-complete problems on graphs","author":"Gavril","year":"1977"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0085","first-page":"177","article-title":"Link length of rectilinear watchman tours in grids","volume":"38","author":"Kranakis","year":"1994","journal-title":"Ars Combinatoria"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0090","article-title":"On approximation behavior of the greedy triangulation","author":"Levcopoulos","year":"1986"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0095","series-title":"Matching parenthesis in parallel","author":"Levcopoulos","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0100","series-title":"Approximation schemes in computational geometry","author":"Das","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0105","first-page":"261","article-title":"Geometric searching and link distances","volume":"519","author":"Das","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0110","first-page":"259","article-title":"Optimal linear-time algorithm for the shortest illuminating line segment in a polygon","author":"Das","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0115","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(89)90185-3","article-title":"An approximate algorithm for the minimal vertex nested polygon problem","volume":"33","author":"Dasgupta","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0120","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(91)90010-C","article-title":"On rectilinear link distance","volume":"1","author":"de Berg","year":"1991","journal-title":"Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0125","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","article-title":"Rectilinear shortest paths in the presence of rectangular barriers","volume":"4","author":"de Rezende","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_rf0130","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","article-title":"An O (n log n) algorithm for computing the link center of a simple polygon","volume":"8","author":"Djidjev","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0135","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0890-5401(88)90049-1","article-title":"Minimum polygonal separation","volume":"77","author":"Edelsbrunner","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0140","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02187785","article-title":"The complexity of many faces in arrangements of lines and of segments","volume":"5","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0145","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(90)90147-A","article-title":"Covering convex sets with non-overlapping polygons","volume":"81","author":"Edelsbrunner","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0150","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(91)90065-5","article-title":"Ordered stabbing of pairwise disjoint convex sets in linear time","volume":"32","author":"Egyed","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0155","series-title":"School of Computer Science","article-title":"Hierarchical decomposition of polygons with applications","author":"ElGindy","year":"1985"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50013-9_bb0160","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","article-title":"A linear algorithm for computing the visibility polygon from a point","volume":"2","author":"ElGindy","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0165","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(90)90038-Y","article-title":"An optimal algorithm for computing a minimum nested nonconvex polygon","volume":"36","author":"Ghosh","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0170","first-page":"106","article-title":"Parallel algorithms for all minimum link paths and link center problems","volume":"621","author":"Ghosh","year":"1992"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50013-9_bb0175","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0925-7721(97)00003-5","article-title":"Optimal on-line algorithms for walking with minimum number of turns in unknown streets","volume":"8","author":"Ghosh","year":"1997","journal-title":"Comput Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0180","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","article-title":"Computing the visibility polygon from a convex set and related problems","volume":"12","author":"Ghosh","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0185","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1006\/jagm.1996.0064","article-title":"A note on computing the visibility polygon from a convex chain","volume":"21","author":"Ghosh","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0190","article-title":"A linear time algorithm for computing a convex path of bounded curvature in a simple polygon","author":"Ghosh","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0195","first-page":"507","article-title":"Planar separators and parallel polygon triangulation","author":"Goodrich","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0200","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","article-title":"Optimal shortest path queries in a simple polygon","volume":"39","author":"Guibas","year":"1989","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/B978-044482537-7\/50013-9_bb0205","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1142\/S0218195993000257","article-title":"Approximating polygons and subdivisions with minimum link paths","volume":"3","author":"Guibas","year":"1993","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0210","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside a triangulated simple polygon","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0215","first-page":"21","article-title":"Generalized guarding and partitioning for rectilinear polygons","volume":"6","author":"Gy\u00f6ri","year":"1996","journal-title":"CGTA"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0220","first-page":"63","article-title":"Computing minimum length paths of a given homotopy class","volume":"4","author":"Hershberger","year":"1994","journal-title":"CGTA"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0225","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/0213038","article-title":"Movement problems for 2-dimensional linkages","volume":"13","author":"Hopcroft","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0230","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0214025","article-title":"On the movement of robot arms in 2-dimensional bounded regions","volume":"14","author":"Hopcroft","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/B978-044482537-7\/50013-9_bb0235","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","article-title":"Efficient algorithms for geometric graph search problems","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0240","first-page":"151","article-title":"On the bit complexity of minimum link paths: Superquadratic algorithms for problems solvable in linear time","author":"Kahan","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0245","series-title":"Handbook of Theoretical Computer Science","first-page":"869","article-title":"Parallel algorithms for shared memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0250","first-page":"69","article-title":"An efficient algorithm for link distance problems inside a simple polygon","author":"Ke","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0255","series-title":"Polygon visibility algorithms for weak visibility and link distance problems","author":"Ke","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0260","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_rf0265","first-page":"163","article-title":"Computing constrained shortest segments: Butterfly wingspans in logarithmic time","author":"Kirkpatrick","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0270","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","article-title":"Walking an unknown street with bounded detour","volume":"1","author":"Klein","year":"1992","journal-title":"Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0275","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1142\/S0218195995000052","article-title":"Manhattonian proximity in a simple polygon","volume":"5","author":"Klein","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0280","doi-asserted-by":"crossref","DOI":"10.1109\/ICAR.1991.240543","article-title":"On the number of links and placement of telescoping manipulators in an environment with obstacles","author":"Kolarov","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0285","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","article-title":"Euclidean shortest paths in the presence of rectilinear barriers","volume":"14","author":"Lee","year":"1984","journal-title":"Networks"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0290","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","article-title":"Visibility of a simple polygon","volume":"22","author":"Lee","year":"1983","journal-title":"Computer Vision, Graphics and Image Process"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0295","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02187913","article-title":"Computing the link center of a simple polygon","volume":"3","author":"Lenhart","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0300","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01206332","article-title":"Optimal parallel algorithms for rectilinear link-distance problems","volume":"14","author":"Lingas","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0305","series-title":"Parallel algorithms for minimum link path and related problems","author":"Maheshwari","year":"1993"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50013-9_bb0310","doi-asserted-by":"crossref","DOI":"10.1142\/S0129626499000062","article-title":"Simple optimal algorithms for rectilinear link path and polygon separation problems","volume":"9","author":"Maheshwari","year":"1999","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0315","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/43.144850","article-title":"Smallest paths in simple rectilinear polygons","volume":"11","author":"McDonald","year":"1992","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0320","doi-asserted-by":"crossref","first-page":"74","DOI":"10.3138\/3535-7609-781G-4L20","article-title":"Automated line generalization","volume":"26","author":"McMaster","year":"1987","journal-title":"Cartographies"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0325","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear time algorithm for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0330","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/SFCS.1992.267794","article-title":"Computing a shortest k-link path in a polygon","author":"Mitchell","year":"1992","journal-title":"Proc. 33rd Annu. IEEE Symp. Found. Comput. Sci."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0335","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01758855","article-title":"Minimum-link paths among obstacles in the plane","volume":"8","author":"Mitchell","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0340","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0925-7721(95)00006-U","article-title":"Separation and approximation of polyhedral objects","volume":"5","author":"Mitchell","year":"1995","journal-title":"Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0345","series-title":"On comparing and compressing piece-wise linear curves","author":"Natarajan","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0350","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(95)00026-7","article-title":"An optimal algorithm for the rectilinear link center of a rectilinear polygon","volume":"6","author":"Nilsson","year":"1996","journal-title":"Comput. Geom"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0355","series-title":"Computational Geometry \u2014 Methods, Algorithms and Applications","first-page":"203","article-title":"Computing the rectilinear link diameter of a polygon","volume":"553","author":"Nilsson","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0360","series-title":"Art Gallery Theorems and Algorithms","author":"O\u2019Rourke","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0365","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/JRA.1987.1087092","article-title":"Minimizing turns for discrete movement in the interior of a polygon","volume":"3","author":"Reif","year":"1987","journal-title":"IEEE J. Robotics and Automation"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0370","first-page":"421","article-title":"Complexity of the mover\u2019s problem and generalizations","author":"Reif","year":"1979","journal-title":"Proc. 20th Annu. IEEE Symp. Found. Comput. Sci"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0375","series-title":"Planning, Geometry and Complexity of Robot Motion","first-page":"267","article-title":"Complexity of the generalized movers problem","author":"Reif","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0380","series-title":"Handbook on Computational Geometry","year":"1999"},{"issue":"10","key":"10.1016\/B978-044482537-7\/50013-9_bb0385","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/12.59852","article-title":"An optimal algorithm for detecting weak visibility of a polygon","volume":"39","author":"Sack","year":"1990","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0390","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1142\/S0218195996000149","article-title":"An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon","volume":"6","author":"Schuierer","year":"1996","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0395","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm for minimum link paths inside a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vision Graph. Image Process."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0400","first-page":"14","article-title":"Worst-case optimal algorithms for constructing visibility polygons with holes","author":"Suri","year":"1986"},{"key":"10.1016\/B978-044482537-7\/50013-9_rf0405","series-title":"Minimum link paths in polygons and related problems","author":"Suri","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0410","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/70.88124","article-title":"On some link distance problems in a simple polygon","volume":"6","author":"Suri","year":"1990","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0415","first-page":"470","article-title":"Finding minimal nested polygons","author":"Suri","year":"1985"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0420","series-title":"On embedding a graph in the grid with minimum number of bends","author":"Tamassia","year":"1986"},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0425","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-8655(86)90015-2","article-title":"Shortest path solves edge-to-edge visibility in a polygon","volume":"4","author":"Toussaint","year":"1986","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/B978-044482537-7\/50013-9_bb0430","first-page":"34","article-title":"Finding the minimum visible vertex distance between two non-intersecting simple polygons","author":"Wang","year":"1986"}],"container-title":["Handbook of Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444825377500139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444825377500139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T20:05:25Z","timestamp":1556827525000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444825377500139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9780444825377"],"references-count":85,"URL":"https:\/\/doi.org\/10.1016\/b978-044482537-7\/50013-9","relation":{},"subject":[],"published":{"date-parts":[[2000]]}}}