{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:35Z","timestamp":1742913395260,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_21","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matching Sets of Line Segments"],"prefix":"10.1007","author":[{"given":"Hyeyun","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3586-3431","authenticated-orcid":false,"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2006.01.005","volume":"37","author":"H Ahn","year":"2007","unstructured":"Ahn, H., Cheong, O., Park, C., Shin, C., Vigneron, A.: Maximizing the overlap of two planar convex sets under rigid motions. Comput. Geom. 37(1), 3\u201315 (2007)","journal-title":"Comput. Geom."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Bl\u00f6mer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13(3), 251\u2013265 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/B978-044482537-7\/50004-8","volume-title":"Handbook of Computational Geometry","author":"H Alt","year":"2000","unstructured":"Alt, H., Guibas, L.J.: Discrete geometric shapes: matching, interpolation, and approximation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 121\u2013153. B.V. North-Holland, Amsterdam (2000). Chapter 3"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H Alt","year":"1988","unstructured":"Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3(3), 237\u2013256 (1988)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"21_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"issue":"6","key":"21_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1142\/S0218195909003118","volume":"19","author":"S Cabello","year":"2009","unstructured":"Cabello, S., de Berg, M., Giannopoulos, P., Knauer, C., van Oostrum, R., Veltkamp, R.C.: Maximizing the area of overlap of two unions of disks under rigid motion. Int. J. Comput. Geom. Appl. 19(6), 533\u2013556 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"10","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/34.58872","volume":"12","author":"HH Chen","year":"1990","unstructured":"Chen, H.H., Huang, T.S.: Matching 3-D line segments with applications to multiple-object motion estimation. IEEE Trans. Pattern Anal. Mach. Intell. 12(10), 1002\u20131008 (1990)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0925-7721(95)00047-X","volume":"7","author":"L Chew","year":"1997","unstructured":"Chew, L., Goodrich, M.T., Huttenlocher, D.P., Kedem, K., Kleinberg, J.M., Kravets, D.: Geometric pattern matching under Euclidean motion. Comput. Geom. 7(1), 113\u2013124 (1997)","journal-title":"Comput. Geom."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica 31(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"issue":"18","key":"21_CR10","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1093\/bioinformatics\/btq404","volume":"26","author":"M Gao","year":"2010","unstructured":"Gao, M., Skolnick, J.: iAlign: a method for the structural comparison of protein-protein interfaces. Bioinformatics 26(18), 2259\u20132265 (2010)","journal-title":"Bioinformatics"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-016-0152-9","volume":"78","author":"S Har-Peled","year":"2017","unstructured":"Har-Peled, S., Roy, S.: Approximating the maximum overlap of polygons under translation. Algorithmica 78(1), 147\u2013165 (2017)","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0925-7721(94)90004-3","volume":"4","author":"PJ Heffernan","year":"1994","unstructured":"Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Comput. Geom. 4(3), 137\u2013156 (1994)","journal-title":"Comput. Geom."},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TPAMI.1984.4767592","volume":"6","author":"GG Medioni","year":"1984","unstructured":"Medioni, G.G., Nevatia, R.: Matching images using linear features. IEEE Trans. Pattern Anal. Mach. Intell. 6(6), 675\u2013685 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/2532647","volume":"10","author":"A Vigneron","year":"2014","unstructured":"Vigneron, A.: Geometric optimization and sums of algebraic functions. ACM Trans. Algorithms 10(1), 4:1\u20134:20 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1142\/S0218195917500029","volume":"27","author":"J Yon","year":"2017","unstructured":"Yon, J., Cheng, S., Cheong, O., Vigneron, A.: Finding largest common point sets. Int. J. Comput. Geom. Appl. 27(3), 177\u2013186 (2017)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:19Z","timestamp":1709823079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}