{"id":"https://openalex.org/W6907167117","doi":"https://doi.org/10.20382/jocg.v16i1a6","title":"Computing smallest convex intersecting polygons","display_name":"Computing smallest convex intersecting polygons","publication_year":2023,"publication_date":"2023-10-03","ids":{"openalex":"https://openalex.org/W6907167117","doi":"https://doi.org/10.20382/jocg.v16i1a6"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4441","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/4441","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Antoniadis, Antonios","orcid":"https://orcid.org/0000-0003-2152-7883"},"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":["University of Twente"],"raw_orcid":"https://orcid.org/0000-0003-2152-7883","affiliations":[{"raw_affiliation_string":"University of Twente","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":null,"display_name":"De Berg, Mark","orcid":"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":["TU Eindhoven"],"raw_orcid":"https://orcid.org/0000-0001-5770-3784","affiliations":[{"raw_affiliation_string":"TU Eindhoven","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Kisfaludi-Bak, S\u00e1ndor","orcid":"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":["Aalto University"],"raw_orcid":"https://orcid.org/0000-0002-6856-2902","affiliations":[{"raw_affiliation_string":"Aalto University","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":null,"display_name":"Skarlatos, Antonis","orcid":"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":["University of Salzburg"],"raw_orcid":"https://orcid.org/0000-0002-7623-9419","affiliations":[{"raw_affiliation_string":"University of Salzburg","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.54803002,"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_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.975600004196167,"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.975600004196167,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.8781999945640564},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.8483999967575073},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.8263999819755554},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7548999786376953},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5860000252723694},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5806999802589417},{"id":"https://openalex.org/keywords/equiangular-polygon","display_name":"Equiangular polygon","score":0.5275999903678894},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.4880000054836273}],"concepts":[{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.8781999945640564},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.8483999967575073},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.8263999819755554},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7548999786376953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6665999889373779},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5860000252723694},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5806999802589417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5722000002861023},{"id":"https://openalex.org/C41779539","wikidata":"https://www.wikidata.org/wiki/Q2543717","display_name":"Equiangular polygon","level":3,"score":0.5275999903678894},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.4880000054836273},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4758000075817108},{"id":"https://openalex.org/C173688413","wikidata":"https://www.wikidata.org/wiki/Q642620","display_name":"Krein\u2013Milman theorem","level":5,"score":0.45829999446868896},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.41999998688697815},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.40130001306533813},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.38929998874664307},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34130001068115234},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.2912999987602234},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27810001373291016},{"id":"https://openalex.org/C6018138","wikidata":"https://www.wikidata.org/wiki/Q332715","display_name":"Absolutely convex set","level":5,"score":0.2556999921798706}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/4441","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire/22bb854d-1db7-4e98-b28d-566c010287a3","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/22bb854d-1db7-4e98-b28d-566c010287a3","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,"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 2025, 'Computing smallest convex intersecting polygons', Journal of Computational Geometry, vol. 16, no. 1, pp. 167-202. https://doi.org/10.20382/jocg.v16i1a6","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:openaire/849b9d34-ca22-49bb-9ce5-ef07bb6304e2","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/849b9d34-ca22-49bb-9ce5-ef07bb6304e2","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,"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 2025, 'Computing Smallest Convex Intersecting Polygons', Journal of computational geometry, vol. 16, no. 1, pp. 167-202. https://doi.org/10.20382/jocg.v16i1a6","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.20382/jocg.v16i1a6","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v16i1a6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4441","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4441","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"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],"$\\mathcal{O}$":[10,48,62,94],"of":[11,32,49,66,74,98,120,123],"objects":[12],"in":[13,20,71,103],"$\\mathbb{R}^2$":[14],"if":[15],"intersects":[17],"each":[18],"object":[19],"$\\mathcal{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]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}