{"id":"https://openalex.org/W1964168400","doi":"https://doi.org/10.1016/0196-6774(91)90024-s","title":"Computing the visibility polygon from a convex set and related problems","display_name":"Computing the visibility polygon from a convex set and related problems","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W1964168400","doi":"https://doi.org/10.1016/0196-6774(91)90024-s","mag":"1964168400"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(91)90024-s","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(91)90024-s","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5103384577","display_name":"Subir Kumar Ghosh","orcid":null},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Subir Kumar Ghosh","raw_affiliation_strings":["Computer Science Group, Tata Institute of Fundamental Research, Bombay 400005, India"],"affiliations":[{"raw_affiliation_string":"Computer Science Group, Tata Institute of Fundamental Research, Bombay 400005, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103384577"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":3.0101,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.90058972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"75","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996999979019165,"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.9912999868392944,"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/simple-polygon","display_name":"Simple polygon","score":0.8111276626586914},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.7966756820678711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7445034384727478},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.6853671073913574},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6619458794593811},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6124576926231384},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.6002734899520874},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.549659252166748},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.5285319685935974},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.5232935547828674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.517634928226471},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4934634268283844},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.48587626218795776},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.4490509629249573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3786722421646118},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.2599375247955322},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21732228994369507},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1701940894126892},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.10511809587478638},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09653854370117188},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05854177474975586}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.8111276626586914},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.7966756820678711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7445034384727478},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.6853671073913574},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6619458794593811},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6124576926231384},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.6002734899520874},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.549659252166748},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.5285319685935974},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.5232935547828674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.517634928226471},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4934634268283844},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.48587626218795776},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.4490509629249573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3786722421646118},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.2599375247955322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21732228994369507},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1701940894126892},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.10511809587478638},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09653854370117188},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05854177474975586},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(91)90024-s","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(91)90024-s","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":26,"referenced_works":["https://openalex.org/W1825136300","https://openalex.org/W1964869106","https://openalex.org/W1971842242","https://openalex.org/W1986014106","https://openalex.org/W1993217815","https://openalex.org/W1999006915","https://openalex.org/W2001513095","https://openalex.org/W2003711098","https://openalex.org/W2017921773","https://openalex.org/W2019236084","https://openalex.org/W2032159439","https://openalex.org/W2033775003","https://openalex.org/W2058872551","https://openalex.org/W2071719615","https://openalex.org/W2086797345","https://openalex.org/W2088617781","https://openalex.org/W2098564400","https://openalex.org/W2111672678","https://openalex.org/W2132339863","https://openalex.org/W4292910193","https://openalex.org/W6648826593","https://openalex.org/W6650227546","https://openalex.org/W6654805621","https://openalex.org/W6655053093","https://openalex.org/W6672348848","https://openalex.org/W6674937898"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2362048241","https://openalex.org/W6840519","https://openalex.org/W2372903818","https://openalex.org/W3082218119","https://openalex.org/W2550862321","https://openalex.org/W2026465854","https://openalex.org/W2610298441","https://openalex.org/W4306671652","https://openalex.org/W2382144060"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}