{"id":"https://openalex.org/W2036462575","doi":"https://doi.org/10.1016/0020-0190(89)90185-3","title":"An approximate algorithm for the minimal vertex nested polygon problem","display_name":"An approximate algorithm for the minimal vertex nested polygon problem","publication_year":1989,"publication_date":"1989-10-01","ids":{"openalex":"https://openalex.org/W2036462575","doi":"https://doi.org/10.1016/0020-0190(89)90185-3","mag":"2036462575"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(89)90185-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90185-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5063144451","display_name":"Bhaskar Dasgupta","orcid":"https://orcid.org/0000-0003-0630-4593"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bhaskar Dasgupta","raw_affiliation_strings":["CMC Ltd., R & D, Secunderabad 500 003, India"],"affiliations":[{"raw_affiliation_string":"CMC Ltd., R & D, Secunderabad 500 003, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007747516","display_name":"C. E. Veni Madhavan","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C.E.Veni Madhavan","raw_affiliation_strings":["Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560 012, India","Department of Computer Science and Automation Indian Institute of Science, Bangalore - 560 012, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560 012, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Computer Science and Automation Indian Institute of Science, Bangalore - 560 012, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063144451"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":2.1984,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87154294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"1","first_page":"35","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.993399977684021,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.993399977684021,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9871000051498413,"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/T12288","display_name":"Optimization and Search Problems","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6209172606468201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5854094624519348},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5536257028579712},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5468282103538513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5376288890838623},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5320780277252197},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5210503935813904},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.4949325919151306},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4546320140361786},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.4506693482398987},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.4212430417537689},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.349906861782074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32907962799072266},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30675071477890015},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.22096890211105347},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.08032482862472534}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6209172606468201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5854094624519348},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5536257028579712},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5468282103538513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5376288890838623},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5320780277252197},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5210503935813904},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.4949325919151306},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4546320140361786},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.4506693482398987},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.4212430417537689},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.349906861782074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32907962799072266},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30675071477890015},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.22096890211105347},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.08032482862472534},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(89)90185-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(89)90185-3","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2005314985","https://openalex.org/W2006710267","https://openalex.org/W2019236084","https://openalex.org/W2084224084","https://openalex.org/W2085761844","https://openalex.org/W2111672678","https://openalex.org/W2163169902","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W3041834803","https://openalex.org/W3198160809","https://openalex.org/W6651833940","https://openalex.org/W6654805621","https://openalex.org/W6671747630","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W1988449797","https://openalex.org/W2466150543","https://openalex.org/W1812659169","https://openalex.org/W3082218119","https://openalex.org/W2362048241","https://openalex.org/W2026465854","https://openalex.org/W2102467404","https://openalex.org/W2155945776","https://openalex.org/W2006710267"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}