{"id":"https://openalex.org/W1968807104","doi":"https://doi.org/10.1142/s0129626492000386","title":"CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING","display_name":"CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING","publication_year":1992,"publication_date":"1992-09-01","ids":{"openalex":"https://openalex.org/W1968807104","doi":"https://doi.org/10.1142/s0129626492000386","mag":"1968807104"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626492000386","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626492000386","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/A5014469123","display_name":"D. Bhagavathi","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. BHAGAVATHI","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086528192","display_name":"Stephan Olariu","orcid":"https://orcid.org/0000-0002-3776-216X"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. OLARIU","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109142529","display_name":"J.L. Schwing","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. L. SCHWING","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101573172","display_name":"Jinming Zhang","orcid":"https://orcid.org/0000-0002-9353-5447"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. ZHANG","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA#TAB#","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I81365321"],"apc_list":null,"apc_paid":null,"fwci":2.6679,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87411095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"02","issue":"02n03","first_page":"249","last_page":"256"},"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.998199999332428,"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.998199999332428,"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.9848999977111816,"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/T12288","display_name":"Optimization and Search Problems","score":0.9559999704360962,"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/polygon-mesh","display_name":"Polygon mesh","score":0.7100427746772766},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.6279993057250977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.617898166179657},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5583368539810181},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5308951735496521},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.4674347937107086},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4338034391403198},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.43254905939102173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37651410698890686},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.22558048367500305},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10687321424484253}],"concepts":[{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7100427746772766},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.6279993057250977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.617898166179657},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5583368539810181},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5308951735496521},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.4674347937107086},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4338034391403198},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.43254905939102173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37651410698890686},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.22558048367500305},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10687321424484253},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626492000386","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626492000386","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2462884115","https://openalex.org/W2278044688","https://openalex.org/W1634652650","https://openalex.org/W2473773916","https://openalex.org/W4297909578","https://openalex.org/W2350818074","https://openalex.org/W2913347331","https://openalex.org/W2810915225","https://openalex.org/W2050284373","https://openalex.org/W3557672"],"abstract_inverted_index":{"We":[0,82],"propose":[1],"time-optimal":[2],"algorithms":[3],"for":[4],"a":[5,21],"number":[6],"of":[7,26,33,55,61,64,70],"convex":[8,43,49,72,89],"polygon":[9],"problems":[10],"on":[11,20],"meshes":[12],"with":[13,23],"multiple":[14,24],"broadcasting.":[15],"Specifically,":[16],"we":[17],"show":[18,84],"that":[19,85],"mesh":[22],"broadcasting":[25],"size":[27],"n":[28],"\u00d7":[29],"n,":[30],"the":[31,53,62,66],"task":[32],"deciding":[34,40,46],"whether":[35,41,47,87],"an":[36],"n-gon":[37,50],"is":[38],"convex,":[39],"two":[42,71,88],"n-gons":[44,73,90],"edge-intersect,":[45],"one":[48],"lies":[51],"in":[52,77],"interior":[54],"another,":[56],"as":[57,59],"well":[58],"variants":[60],"tasks":[63],"computing":[65],"intersection":[67],"and":[68],"union":[69],"can":[74],"be":[75],"accomplished":[76],"\u0398(":[78],"log":[79],"n)":[80],"time.":[81,95],"also":[83],"detecting":[86],"are":[91],"separable":[92],"takes":[93],"O(1)":[94]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}