{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T04:16:55Z","timestamp":1746850615833,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_3","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"32-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Rectilinear Convex Hull of\u00a0Line Segments"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Alegr\u00eda","sequence":"first","affiliation":[]},{"given":"Justin","family":"Dallant","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-022-01238-9","volume":"85","author":"C Alegr\u00eda","year":"2022","unstructured":"Alegr\u00eda, C., Orden, D., Seara, C., Urrutia, J.: Separating bichromatic point sets in the plane by restricted orientation convex hulls maintenance of maxima of 2D point sets. J. Global Optim. 85, 1\u201334 (2022). https:\/\/doi.org\/10.1007\/s10898-022-01238-9","journal-title":"J. Global Optim."},{"issue":"8","key":"3_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.comgeo.2011.04.002","volume":"44","author":"T Biedl","year":"2011","unstructured":"Biedl, T., Gen\u00e7, B.: Reconstructing orthogonal Polyhedra from putative vertex sets. Comput. Geomet. Theor. Appl. 44(8), 409\u2013417 (2011). https:\/\/doi.org\/10.1016\/j.comgeo.2011.04.002","journal-title":"Comput. Geomet. Theor. Appl."},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discr. Comput. Geom. 10(4), 377\u2013409 (1993). https:\/\/doi.org\/10.1007\/bf02573985","DOI":"10.1007\/bf02573985"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Davari, M.J., Edalat, A., Lieutier, A.: The convex hull of finitely generable subsets and its predicate transformer. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE (2019). https:\/\/doi.org\/10.1109\/lics.2019.8785680","DOI":"10.1109\/lics.2019.8785680"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(95)00132-V","volume":"56","author":"O Devillers","year":"1995","unstructured":"Devillers, O., Golin, M.J.: Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. Inf. Process. Lett. 56(3), 157\u2013164 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00132-V","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.comgeo.2010.07.005","volume":"44","author":"JM D\u00edaz-Ba\u00f1ez","year":"2011","unstructured":"D\u00edaz-Ba\u00f1ez, J.M., L\u00f3pez, M.A., Mora, M., Seara, C., Ventura, I.: Fitting a two-joint orthogonal chain to a point set. Comput. Geom. 44(3), 135\u2013147 (2011). https:\/\/doi.org\/10.1016\/j.comgeo.2010.07.005","journal-title":"Comput. Geom."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Fink, E., Wood, D.: Restricted-orientation Convexity. Monographs in Theoretical Computer Science (An EATCS Series). 1st Edn. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18849-7","DOI":"10.1007\/978-3-642-18849-7"},{"key":"3_CR8","unstructured":"Fran\u011bk, V.: On algorithmic characterization of functional $$D$$-convex hulls, Ph. D. thesis, Faculty of Mathematics and Physics, Charles University in Prague (2008)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.comgeo.2008.03.003","volume":"42","author":"V Fran\u011bk","year":"2009","unstructured":"Fran\u011bk, V., Matou\u0161ek, J.: Computing $$D$$-convex hulls in the plane. Comput. Geomet. Theor. Appl. 42(1), 81\u201389 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.03.003","journal-title":"Comput. Geomet. Theor. Appl."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of $$n$$ line segments in $${O}(n\\log n)$$ time. Inf. Process. Lett. 33, 169\u2013174 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90136-1","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discr. Comput. Geomet. 1(1), 59\u201371 (1986). https:\/\/doi.org\/10.1007\/BF02187683","journal-title":"Discr. Comput. Geomet."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"AA Melkman","year":"1987","unstructured":"Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Inf. Process. Lett. 25(1), 11\u201312 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90086-X","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BF02320367","volume":"60","author":"NN Metelskii","year":"1996","unstructured":"Metelskii, N.N., Martynchik, V.N.: Partial convexity. Math. Notes 60(3), 300\u2013305 (1996). https:\/\/doi.org\/10.1007\/BF02320367","journal-title":"Math. Notes"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/BF01933620","volume":"23","author":"TM Nicholl","year":"1983","unstructured":"Nicholl, T.M., Lee, D.T., Liao, Y.Z., Wong, C.K.: On the X-Y convex hull of a set of X-Y polygons. BIT Numer. Math. 23(4), 456\u2013471 (1983). https:\/\/doi.org\/10.1007\/BF01933620","journal-title":"BIT Numer. Math."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0255(84)90025-2","volume":"33","author":"T Ottmann","year":"1984","unstructured":"Ottmann, T., Soisalon-Soininen, E., Wood, D.: On the definition and computation of rectilinear convex hulls. Inf. Sci. 33(3), 157\u2013171 (1984). https:\/\/doi.org\/10.1016\/0020-0255(84)90025-2","journal-title":"Inf. Sci."},{"key":"3_CR16","unstructured":"P\u00e9rez-Lantero, P., Seara, C., Urrutia, J.: A fitting problem in three dimension. In: Book of Abstracts of the XX Spanish Meeting on Computational Geometry, pp. 21\u201324. EGC 2023 (2023)"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Text and Monographs in Computer Science. 1st Edn. Springer, NY (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"3_CR18","unstructured":"Rawlins, G.J.E.: Explorations in restricted-orientation geometry, Ph. D. thesis, School of Computer Science, University of Waterloo (1987)"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Rawlins, G.J., Wood, D.: Ortho-convexity and its generalizations. In: Toussaint, G.T. (ed.) Computational Morphology, Machine Intelligence and Pattern Recognition, vol. 6, pp. 137\u2013152. North-Holland (1988). https:\/\/doi.org\/10.1016\/B978-0-444-70467-2.50015-1","DOI":"10.1016\/B978-0-444-70467-2.50015-1"},{"key":"3_CR20","unstructured":"Schuierer, S., Wood, D.: Restricted-orientation visibility. Tech. Rep. 40, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (1991)"},{"key":"3_CR21","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press (1995)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Wang, C., Zhou, R.G.: A quantum search algorithm of two-dimensional convex hull. Commun. Theoret. Phys. 73(11), 115102 (2021). https:\/\/doi.org\/10.1088\/1572-9494\/ac1da0","DOI":"10.1088\/1572-9494\/ac1da0"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02187894","volume":"3","author":"A Wiernik","year":"1988","unstructured":"Wiernik, A., Sharir, M.: Planar realizations of nonlinear Davenport-Schinzel sequences by segments. Discr. Comput. Geomet. 3(1), 15\u201347 (1988). https:\/\/doi.org\/10.1007\/BF02187894","journal-title":"Discr. Comput. Geomet."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:35:39Z","timestamp":1699911339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","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":"43% - 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":"3","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)"}}]}}