{"id":"https://openalex.org/W4292219087","doi":"https://doi.org/10.4230/lipics.esa.2022.9","title":"Computing Smallest Convex Intersecting Polygons","display_name":"Computing Smallest Convex Intersecting Polygons","alternate_titles":[],"publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4292219087","doi":"https://doi.org/10.4230/lipics.esa.2022.9"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16947","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol244-esa2022/LIPIcs.ESA.2022.9/LIPIcs.ESA.2022.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W6929142574","display_name":"LIPIcs, Volume 244, ESA 2022, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W4292219087","https://openalex.org/W6929142574"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol244-esa2022/LIPIcs.ESA.2022.9/LIPIcs.ESA.2022.9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Antoniadis, Antonios","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Antoniadis, Antonios","raw_affiliation_strings":["Department for Applied Mathematics, University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department for Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784","observed_orcids":["https://orcid.org/0000-0001-5770-3784"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"de Berg, Mark","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057527289","display_name":"\u202aS\u00e1ndor Kisfaludi-Bak","orcid":"https://orcid.org/0000-0002-6856-2902","observed_orcids":["https://orcid.org/0000-0002-6856-2902"]},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kisfaludi-Bak, S\u00e1ndor","raw_affiliation_strings":["Department of Computer Science, Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0000-0002-6856-2902","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073557610","display_name":"Antonis Skarlatos","orcid":"https://orcid.org/0000-0002-7623-9419","observed_orcids":["https://orcid.org/0000-0002-7623-9419"]},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Skarlatos, Antonis","raw_affiliation_strings":["Department of Computer Science, Universi\u00e4t Salzburg, Austria"],"raw_orcid":"https://orcid.org/0000-0002-7623-9419","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universi\u00e4t Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007300000172108412,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convex-polygons","display_name":"convex polygons","score":0.7879999876022339},{"id":"https://openalex.org/keywords/polynomial-time-exact-algorithm","display_name":"polynomial-time exact algorithm","score":0.6060000061988831},{"id":"https://openalex.org/keywords/line-segments","display_name":"line segments","score":0.6759999990463257},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.7749999761581421}],"concepts":[{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.84526526927948},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.8321611285209656},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.7934756278991699},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7890939116477966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7112215757369995},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6218284368515015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6050682067871094},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5793330073356628},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.54902583360672},{"id":"https://openalex.org/C173688413","wikidata":"https://www.wikidata.org/wiki/Q642620","display_name":"Krein\u2013Milman theorem","level":5,"score":0.524546205997467},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.5245243310928345},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.5059804320335388},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4892580509185791},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4760453701019287},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4246990382671356},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.4074075520038605},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.29404646158218384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19288209080696106},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.12705931067466736},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:16947","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol244-esa2022/LIPIcs.ESA.2022.9/LIPIcs.ESA.2022.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:ris.utwente.nl:openaire/2a68e987-568e-4a97-a1dd-670accfba189","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/files/298170251/LIPIcs_ESA_2022_9.pdf","pdf_url":"https://ris.utwente.nl/ws/files/298170251/LIPIcs_ESA_2022_9.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Antoniadis, A, de Berg, M, Kisfaludi-Bak, S & Skarlatos, A 2022, Computing Smallest Convex Intersecting Polygons. in S Chechik, G Navarro, E Rotenberg & G Herman (eds), 30th Annual European Symposium on Algorithms (ESA 2022)., 9, Leibniz International Proceedings in Informatics (LIPIcs), vol. 244, Dagstuhl, 30th Annual European Symposium on Algorithms, ESA 2022, Berlin, Germany, 5/09/22. https://doi.org/10.4230/LIPIcs.ESA.2022.9","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/117219","doi":null,"is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/5fa75960-8d03-4400-b0d1-9c4d41787f08","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire/6e804818-be2c-489b-9791-1e4f9c759bbb","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6e804818-be2c-489b-9791-1e4f9c759bbb","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Antoniadis, A, Berg, M D, Kisfaludi-Bak, S & Skarlatos, A 2022, Computing Smallest Convex Intersecting Polygons. in S Chechik, G Navarro, E Rotenberg & G Herman (eds), 30th Annual European Symposium on Algorithms, ESA 2022., 9, Leibniz International Proceedings in Informatics, LIPIcs, vol. 244, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, 5/09/22. https://doi.org/10.4230/LIPIcs.ESA.2022.9","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:arXiv.org:2208.07567","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2208.07567","pdf_url":"https://arxiv.org/pdf/2208.07567","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:cb868dd6124b4f68aac94ca19e2abcbd","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/cb868dd6124b4f68aac94ca19e2abcbd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 16, Iss 1 (2025)","raw_type":"article"},{"id":"pmh:oai:pure.tue.nl:openaire/57c6fe1b-6991-49b6-8d09-51531890ddb5","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/57c6fe1b-6991-49b6-8d09-51531890ddb5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Antoniadis, A, Berg, M D, Kisfaludi-Bak, S & Skarlatos, A 2022, 'Computing Smallest Convex Intersecting Polygons', arXiv, vol. 2022, 2208.07567. https://doi.org/10.48550/arXiv.2208.07567","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:openaire/8b025d59-7a0c-426b-98be-c0eb099c3a8e","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/8b025d59-7a0c-426b-98be-c0eb099c3a8e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Antoniadis, A, de Berg, M, Kisfaludi-Bak, S & Skarlatos, A 2022 'Computing Smallest Convex Intersecting Polygons' ArXiv.org. https://doi.org/10.48550/arXiv.2208.07567","raw_type":"info:eu-repo/semantics/preprint"},{"id":"pmh:tue:oai:pure.tue.nl:publications/57c6fe1b-6991-49b6-8d09-51531890ddb5","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/57c6fe1b-6991-49b6-8d09-51531890ddb5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv, 2022:2208.07567. Cornell University Library","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/2a68e987-568e-4a97-a1dd-670accfba189","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/2a68e987-568e-4a97-a1dd-670accfba189","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"30th Annual European Symposium on Algorithms","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.2208.07567","doi":"https://doi.org/10.48550/arxiv.2208.07567","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2208.07567","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.esa.2022.9","doi":"https://doi.org/10.4230/lipics.esa.2022.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2022.9","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16947","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol244-esa2022/LIPIcs.ESA.2022.9/LIPIcs.ESA.2022.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G565383568","display_name":null,"funder_award_id":"024-002-003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G725356751","display_name":null,"funder_award_id":"NETWORKS- 024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4292219087.pdf","grobid_xml":"https://content.openalex.org/works/W4292219087.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1965099828","https://openalex.org/W1986642089","https://openalex.org/W2000358470","https://openalex.org/W2026291033","https://openalex.org/W2035400240","https://openalex.org/W2041775009","https://openalex.org/W2046670590","https://openalex.org/W2098527118","https://openalex.org/W2105946172","https://openalex.org/W2125334953","https://openalex.org/W2151549243","https://openalex.org/W2767541918","https://openalex.org/W3033574327","https://openalex.org/W3137797891","https://openalex.org/W3169940233"],"related_works":["https://openalex.org/W2155070046","https://openalex.org/W2046670590","https://openalex.org/W2070789991","https://openalex.org/W1525225516","https://openalex.org/W1988025634","https://openalex.org/W3120289254","https://openalex.org/W7100874654","https://openalex.org/W1592173722","https://openalex.org/W2069683521","https://openalex.org/W186948357"],"abstract_inverted_index":{"A":[0],"polygon":[1,6,24,37,43,89,119],"C":[2,16],"is":[3,63,95],"an":[4,53,81],"intersecting":[5,36,42,68,88,101,118],"for":[7,44,55,58,85,90,114],"a":[8,45,64,96],"set":[9,47,65,97],"O":[10,48,62,94],"of":[11,32,49,66,74,98,120,123],"objects":[12],"in":[13,20,71,103],"\u211d\u00b2":[14],"if":[15],"intersects":[17],"each":[18],"object":[19],"O,":[21],"where":[22,61,93],"the":[23,30,34,39,59,72,86,91,104,115],"includes":[25],"its":[26],"interior.":[27],"We":[28,51],"study":[29],"problem":[31],"computing":[33],"minimum-perimeter":[35,87],"and":[38],"minimum-area":[40],"convex":[41,69],"given":[46],"objects.":[50],"present":[52,80],"FPTAS":[54],"both":[56],"problems":[57],"case":[60,92],"possibly":[67,100],"polygons":[70],"plane":[73],"total":[75],"complexity":[76],"n.":[77],"Furthermore,":[78],"we":[79],"exact":[82,109],"polynomial-time":[83,108],"algorithm":[84],"n":[99],"segments":[102],"plane.":[105],"So":[106],"far,":[107],"algorithms":[110],"were":[111],"only":[112],"known":[113],"minimum":[116],"perimeter":[117],"lines":[121],"or":[122],"disjoint":[124],"segments.":[125]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4292219087","counts_by_year":[],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2022-08-18T00:00:00"}
