{"id":"https://openalex.org/W2043143954","doi":"https://doi.org/10.1080/00207160211923","title":"Computing the Smallest T-Shaped Polygon Containing k Points","display_name":"Computing the Smallest T-Shaped Polygon Containing k Points","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2043143954","doi":"https://doi.org/10.1080/00207160211923","mag":"2043143954"},"language":"en","primary_location":{"id":"doi:10.1080/00207160211923","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211923","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I4210138551","display_name":"University Hospital Magdeburg","ror":"https://ror.org/03m04df46","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210138551"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michiel Smid","raw_affiliation_strings":["a   Department of Computer Science , University of Magdeburg ,  Magdeburg ,  D-39106 ,  Germany","Department of Computer Science , University of Magdeburg , Magdeburg , D-39106 , Germany"],"affiliations":[{"raw_affiliation_string":"a   Department of Computer Science , University of Magdeburg ,  Magdeburg ,  D-39106 ,  Germany","institution_ids":["https://openalex.org/I4210138551"]},{"raw_affiliation_string":"Department of Computer Science , University of Magdeburg , Magdeburg , D-39106 , Germany","institution_ids":["https://openalex.org/I4210138551"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069510765","display_name":"Vanam Srilakshmi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210138551","display_name":"University Hospital Magdeburg","ror":"https://ror.org/03m04df46","country_code":"DE","type":"healthcare","lineage":["https://openalex.org/I4210138551"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vanam Srilakshmi","raw_affiliation_strings":["a   Department of Computer Science , University of Magdeburg ,  Magdeburg ,  D-39106 ,  Germany","Department of Computer Science , University of Magdeburg , Magdeburg , D-39106 , Germany"],"affiliations":[{"raw_affiliation_string":"a   Department of Computer Science , University of Magdeburg ,  Magdeburg ,  D-39106 ,  Germany","institution_ids":["https://openalex.org/I4210138551"]},{"raw_affiliation_string":"Department of Computer Science , University of Magdeburg , Magdeburg , D-39106 , Germany","institution_ids":["https://openalex.org/I4210138551"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108374265"],"corresponding_institution_ids":["https://openalex.org/I4210138551"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12969211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"79","issue":"2","first_page":"143","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9932000041007996,"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"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/polygon","display_name":"Polygon (computer graphics)","score":0.803028404712677},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7871593832969666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7727150917053223},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.683866024017334},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6174831390380859},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.6046116352081299},{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.6028094291687012},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5852138996124268},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4895268380641937},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4675546884536743},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46698302030563354},{"id":"https://openalex.org/keywords/equiangular-polygon","display_name":"Equiangular polygon","score":0.45258060097694397},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41673174500465393},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3613203167915344},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.33332669734954834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.332707941532135},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2622460126876831},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1819746494293213},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11191734671592712},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.10145139694213867}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.803028404712677},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7871593832969666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7727150917053223},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.683866024017334},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6174831390380859},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.6046116352081299},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.6028094291687012},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5852138996124268},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4895268380641937},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4675546884536743},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46698302030563354},{"id":"https://openalex.org/C41779539","wikidata":"https://www.wikidata.org/wiki/Q2543717","display_name":"Equiangular polygon","level":3,"score":0.45258060097694397},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41673174500465393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3613203167915344},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.33332669734954834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.332707941532135},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2622460126876831},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1819746494293213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11191734671592712},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.10145139694213867},{"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},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160211923","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211923","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1646289414","https://openalex.org/W2005314985","https://openalex.org/W2007046733","https://openalex.org/W2010790640","https://openalex.org/W2046227217","https://openalex.org/W2065967395","https://openalex.org/W2073335364","https://openalex.org/W2139594840","https://openalex.org/W2148929065","https://openalex.org/W2149906774","https://openalex.org/W2752885492","https://openalex.org/W3137349107","https://openalex.org/W4242246215"],"related_works":["https://openalex.org/W2466150543","https://openalex.org/W2608536130","https://openalex.org/W2026465854","https://openalex.org/W2372903818","https://openalex.org/W1988449797","https://openalex.org/W3190428801","https://openalex.org/W2362048241","https://openalex.org/W6840519","https://openalex.org/W2913852997","https://openalex.org/W3036994771"],"abstract_inverted_index":{"A":[0],"T-polygon":[1,40,61,112,124],"is":[2],"an":[3,18,96,105],"axes-parallel":[4],"polyon":[5],"with":[6],"eight":[7],"edges":[8],"having":[9],"the":[10,13,35,51,56,101,110],"shape":[11],"of":[12,31,44,55,117],"letter":[14],"T.":[15],"We":[16,93],"give":[17,95],"O":[19,69,83,134,154],"(":[20,70,84,135,138,144,155],"n":[21,32,71,73,85,136,139,150,156,158],")-time":[22],"algorithm":[23,65,97,130],"that":[24,113,122],"decides,":[25],"when":[26,99],"given":[27,100],"a":[28,38],"set":[29,102],"S":[30,45,103,118],"points":[33,43,116],"in":[34,68,82],"plane,":[36],"whether":[37],"minimum-size":[39,60,111],"enclosing":[41],"all":[42],"exists.":[46],"Here,":[47],"size":[48,77,89],"refers":[49,78,90],"to":[50,79,91],"area":[52],"or":[53,120],"perimeter":[54],"T-polygon.":[57],"If":[58],"this":[59,123],"exists,":[62],"then":[63],"our":[64],"computes":[66,109],"it":[67],"log":[72,149,157],")":[74,86,142,159],"time":[75,87,133],"if":[76,88],"area,":[80],"and":[81,104,152],"perimeter.":[92],"also":[94],"that,":[98],"integer":[106],"k":[107,115,141,145,148],",":[108,119],"contains":[114],"decides":[121],"does":[125],"not":[126],"exist.":[127],"The":[128],"latter":[129],"has":[131],"running":[132],"2":[137,143,146],"m":[140],"+":[147],"))":[151],"uses":[153],"space.":[160]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}