{"id":"https://openalex.org/W2155697686","doi":"https://doi.org/10.1142/s0218195992000123","title":"A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES","display_name":"A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2155697686","doi":"https://doi.org/10.1142/s0218195992000123","mag":"2155697686"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195992000123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195992000123","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & Applications","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/A5102706610","display_name":"Sharat Chandran","orcid":"https://orcid.org/0000-0002-2586-2032"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SHARAT CHANDRAN","raw_affiliation_strings":["NTT Data Communications Systems Corporation, 66\u20132 Horikawa-cho, Saiwai-ku, Kawasaki, Japan 210, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Data Communications Systems Corporation, 66\u20132 Horikawa-cho, Saiwai-ku, Kawasaki, Japan 210, Japan","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DAVID M. MOUNT","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.667,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.71834993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"02","issue":"02","first_page":"191","last_page":"214"},"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.9994000196456909,"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.9994000196456909,"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.9984999895095825,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/convex-polygon","display_name":"Convex polygon","score":0.6767874360084534},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6743661165237427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6567956209182739},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6003308892250061},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5935439467430115},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.57182776927948},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5531144738197327},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5408182144165039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48250603675842285},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4824707806110382},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.44328761100769043},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4172983765602112},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2951694130897522},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10369563102722168}],"concepts":[{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.6767874360084534},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6743661165237427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6567956209182739},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6003308892250061},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5935439467430115},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.57182776927948},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5531144738197327},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5408182144165039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48250603675842285},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4824707806110382},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.44328761100769043},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4172983765602112},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2951694130897522},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10369563102722168},{"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/s0218195992000123","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195992000123","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & Applications","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/W2159582411","https://openalex.org/W119726163","https://openalex.org/W2395040170","https://openalex.org/W2810915225","https://openalex.org/W2080255048","https://openalex.org/W2155697686","https://openalex.org/W2045156582","https://openalex.org/W1564936167","https://openalex.org/W2155239911","https://openalex.org/W78499400"],"abstract_inverted_index":{"We":[0,28,50],"consider":[1],"the":[2,6,18,90,99],"problems":[3,32,48,62,97],"of":[4,60,92],"computing":[5],"largest":[7],"area":[8,20],"triangle":[9,21],"enclosed":[10],"within":[11],"a":[12,24,38,53,76],"given":[13,25],"n-sided":[14],"convex":[15,26],"polygon":[16],"and":[17],"smallest":[19],"which":[22,44],"encloses":[23],"polygon.":[27],"show":[29],"that":[30,57],"these":[31,61,83],"are":[33],"closely":[34],"related":[35],"by":[36],"presenting":[37],"single":[39],"sequential":[40],"linear":[41],"time":[42,68],"algorithm":[43,56],"essentially":[45],"solves":[46,58],"both":[47,59],"simultaneously.":[49],"also":[51],"present":[52],"cost-optimal":[54],"parallel":[55,93],"in":[63],"O(":[64],"log":[65,66,71,72],"n)":[67],"using":[69],"n/":[70],"n":[73],"processors":[74],"on":[75],"CRCW":[77],"PRAM.":[78],"In":[79],"order":[80],"to":[81],"achieve":[82],"bounds":[84],"we":[85],"develop":[86],"new":[87],"techniques":[88],"for":[89,95],"design":[91],"algorithms":[94],"computational":[96],"involving":[98],"rotating":[100],"calipers":[101],"method.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}