{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T21:05:23Z","timestamp":1780607123352,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T00:00:00Z","timestamp":1540166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,22]]},"DOI":"10.1145\/3207677.3277948","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T10:19:29Z","timestamp":1539857969000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments"],"prefix":"10.1145","author":[{"given":"Nan","family":"Li","sequence":"first","affiliation":[{"name":"Dalian Maritime University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[{"name":"Dalian Maritime University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nannan","family":"Li","sequence":"additional","affiliation":[{"name":"Dalian Maritime University, Dalian, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Garey M.R and Johnson D.S. 1979. Computers and intractability: A Guide to the Theory of NPCompleteness. Freeman San Francisco California USA.","DOI":"10.5555\/578533"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00011-0"},{"key":"e_1_3_2_1_3_1","volume-title":"Research on the Algorithm for Euclidean Shortest Paths of Visiting Line Segments in the Plane","author":"Wang Lijuan","year":"2014","unstructured":"Lijuan Wang, Bo Jiang, Qi Wei, and Dandan He. 2014. Research on the Algorithm for Euclidean Shortest Paths of Visiting Line Segments in the Plane, ICIC Express Letters, 2014, 8(6), 1683--1688."},{"key":"e_1_3_2_1_4_1","volume-title":"Algorithmica","author":"L\u00f6ffler Maarten","year":"2008","unstructured":"Maarten L\u00f6ffler and Marc van Kreveld. 2008. Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica, 2008."},{"key":"e_1_3_2_1_5_1","volume-title":"Int. J. Comput. Geom. Appl.","author":"D.","year":"1995","unstructured":"Rappaport, D. 1995. Minimum polygon transversals of line segments. Int. J. Comput. Geom. Appl. 1995, 5(3), 243--256."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Goodrich M.T. and Snoeyink J. 1990. Stabbing parallel segments with a convex polygon. Computer Vision Graphics and Image Processing 1990 49(2) 152--170. 10.1016\/0734-189X(90)90135-I","DOI":"10.1016\/0734-189X(90)90135-I"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9516-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03367-4_32"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.06.002"},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Mechatronics and Intelligent Robotics. Springer","author":"Jia","year":"2017","unstructured":"Jia Y, and Jiang B. 2017. The Minimum Perimeter Convex Hull of a Given Set of Disjoint Segments. International Conference on Mechatronics and Intelligent Robotics. Springer, Cham, 2017, 308--318."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008645"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.108"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008657"},{"key":"e_1_3_2_1_14_1","first-page":"52","article-title":"2011. Faster Batched Shortest Paths in Road Networks. In ATMOS","volume":"20","author":"Delling D.","year":"2011","unstructured":"D. Delling, A. V. Goldberg, and R. F. Werneck. 2011. Faster Batched Shortest Paths in Road Networks. In ATMOS, OASIcs 20, 2011, 52--63.","journal-title":"OASIcs"},{"key":"e_1_3_2_1_15_1","volume-title":"Information Processing Letters","author":"Graham RL","year":"1972","unstructured":"RL Graham. 1972. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1972, 1(4), 132--133"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11949534_28"}],"event":{"name":"CSAE '18: The 2nd International Conference on Computer Science and Application Engineering","location":"Hohhot China","acronym":"CSAE '18"},"container-title":["Proceedings of the 2nd International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3207677.3277948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3207677.3277948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T20:43:31Z","timestamp":1780605811000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3207677.3277948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,22]]},"references-count":16,"alternative-id":["10.1145\/3207677.3277948","10.1145\/3207677"],"URL":"https:\/\/doi.org\/10.1145\/3207677.3277948","relation":{},"subject":[],"published":{"date-parts":[[2018,10,22]]},"assertion":[{"value":"2018-10-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}