{"id":"https://openalex.org/W2038867498","doi":"https://doi.org/10.1142/s0129626499000062","title":"SIMPLE OPTIMAL ALGORITHMS FOR RECTILINEAR LINK PATH AND POLYGON SEPARATION PROBLEMS","display_name":"SIMPLE OPTIMAL ALGORITHMS FOR RECTILINEAR LINK PATH AND POLYGON SEPARATION PROBLEMS","publication_year":1999,"publication_date":"1999-03-01","ids":{"openalex":"https://openalex.org/W2038867498","doi":"https://doi.org/10.1142/s0129626499000062","mag":"2038867498"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000062","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000062","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel 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/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"ANIL MAHESHWARI","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085978384","display_name":"J\u00f6rg-R\u00fcdiger Sack","orcid":"https://orcid.org/0000-0001-5936-1319"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J\u00d6RG-R\u00dcDIGER SACK","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103136561"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":0.3472,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65418288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"09","issue":"01","first_page":"31","last_page":"42"},"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.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9538000226020813,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.825372576713562},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7115656137466431},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.6793486475944519},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6098330020904541},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.6030203700065613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5905066728591919},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.5824360847473145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5326499342918396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49357855319976807},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47466233372688293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3650209307670593},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.300815612077713},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11050593852996826}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.825372576713562},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7115656137466431},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.6793486475944519},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6098330020904541},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.6030203700065613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5905066728591919},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.5824360847473145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5326499342918396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49357855319976807},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47466233372688293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3650209307670593},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.300815612077713},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11050593852996826},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626499000062","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000062","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel 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":5,"referenced_works":["https://openalex.org/W1990495796","https://openalex.org/W2017400043","https://openalex.org/W2078370308","https://openalex.org/W2106413026","https://openalex.org/W2113370909"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2372903818","https://openalex.org/W2362048241","https://openalex.org/W2102467404","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W2362265576","https://openalex.org/W2466150543","https://openalex.org/W2381384555","https://openalex.org/W1993484075"],"abstract_inverted_index":{"The":[0,43,114,171,203],"link":[1,46,93],"metric,":[2],"defined":[3],"on":[4,236],"a":[5,16,35,54,90,96,109,141,179,211],"constrained":[6],"region":[7,98],"R":[8,21,38,70],"of":[9,18,27,58,62,111,116,121,124,134,137,151,185,196,214],"the":[10,13,24,40,59,122,131,135,160,166,201,237],"plane,":[11],"sets":[12],"distance":[14],"between":[15,39,64,190],"pair":[17],"points":[19,66],"in":[20,37,67,95,200],"to":[22,33,52,88,146,159,234],"equal":[23],"minimum":[25,44,60,91,161,167,172,183,204,212],"number":[26,61,184,213],"line":[28,218],"segments":[29,219],"or":[30],"links":[31,63],"needed":[32],"construct":[34],"path":[36,47,56,94],"point":[41],"pair.":[42],"rectilinear":[45,55,75,92,180,193,226],"problem":[48,164,175,207],"considered":[49],"here":[50],"is":[51,71,188,198],"compute":[53,89],"consisting":[57],"two":[65,191,222],"R,":[68,138],"when":[69],"inside":[72],"an":[73,156],"n-sided":[74],"simple":[76,143,225],"polygon.":[77],"In":[78],"this":[79],"paper":[80],"we":[81,139,154],"present":[82],"optimal":[83,157],"sequential":[84],"and":[85,126,144,165,217,248],"parallel":[86,101,229,242],"algorithms":[87,230],"trapezoided":[97],"R.":[99],"Our":[100],"algorithm":[102,118,123],"requires":[103],"O(":[104],"log":[105],"n)":[106],"time":[107],"using":[108],"total":[110],"O(n)":[112],"operations.":[113],"complexity":[115],"our":[117,152],"matches":[119],"that":[120,187,220],"McDonald":[125],"Peters":[127],"[19].":[128],"By":[129],"exploiting":[130],"dual":[132],"structure":[133],"trapezoidation":[136],"obtain":[140],"conceptually":[142],"easy":[145],"implement":[147],"algorithm.":[148],"As":[149],"applications":[150],"techniques":[153],"provide":[155],"solution":[158],"nested":[162,173,189],"polygon":[163,168,174,205],"separation":[169,206],"problem.":[170],"asks":[176,208],"for":[177,209],"finding":[178],"polygon,":[181],"with":[182],"sides,":[186],"given":[192,223],"polygons":[194],"one":[195],"which":[197],"contained":[199],"other.":[202],"computing":[210],"orthogonal":[215],"lines":[216],"separate":[221],"non-intersecting":[224],"polygons.":[227],"All":[228],"are":[231,249],"deterministic,":[232],"designed":[233],"run":[235],"exclusive":[238,240],"read":[239],"write":[241],"random":[243],"access":[244],"machine":[245],"(EREW":[246],"PRAM),":[247],"optimal.":[250]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}