{"id":"https://openalex.org/W200390202","doi":null,"title":"Efficient parallel techniques for computational geometry","display_name":"Efficient parallel techniques for computational geometry","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W200390202","mag":"200390202"},"language":"en","primary_location":{"id":"pmh:oai:docs.lib.purdue.edu:dissertations-29475","doi":null,"is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/dissertations/AAI8807610","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations Available from ProQuest","raw_type":"text"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"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/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X","observed_orcids":["https://orcid.org/0000-0002-8943-191X","https://orcid.org/0000-0002-2489-5705"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113562454","display_name":"Mikhail J. Atallah","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikhail J. Atallah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9409000277519226,"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.9409000277519226,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.024299999698996544,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.01889999955892563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/parallel-algorithms","display_name":"parallel algorithms","score":0.9300000071525574},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.9779999852180481},{"id":"https://openalex.org/keywords/convex-hull","display_name":"convex hull","score":0.9020000100135803},{"id":"https://openalex.org/keywords/polygon-triangulation","display_name":"polygon triangulation","score":0.9980000257492065},{"id":"https://openalex.org/keywords/point-visibility","display_name":"point visibility","score":0.7789999842643738},{"id":"https://openalex.org/keywords/trapezoidal-decomposition","display_name":"trapezoidal decomposition","score":0.9990000128746033},{"id":"https://openalex.org/keywords/planar-point-location","display_name":"planar point location","score":0.9710000157356262},{"id":"https://openalex.org/keywords/pram-model","display_name":"PRAM model","score":0.652999997138977},{"id":"https://openalex.org/keywords/linear-speedup","display_name":"linear speedup","score":0.8420000076293945}],"concepts":[{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.6660323739051819},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6347116231918335},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.5572060942649841},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5390945672988892},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5336495041847229},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4747883677482605},{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.46875476837158203},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.46193137764930725},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.46127036213874817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45963841676712036},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4442683160305023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43890145421028137},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.4328536093235016},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.394769549369812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3346824645996094},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3331137001514435},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.11488702893257141},{"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":2,"locations":[{"id":"pmh:oai:docs.lib.purdue.edu:dissertations-29475","doi":null,"is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/dissertations/AAI8807610","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations Available from ProQuest","raw_type":"text"},{"id":"mag:200390202","doi":null,"is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=29475&context=dissertations","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1963700323","https://openalex.org/W7100522737","https://openalex.org/W2105778456","https://openalex.org/W2042607215","https://openalex.org/W2286140110","https://openalex.org/W2545761387","https://openalex.org/W2008336875","https://openalex.org/W2120104755","https://openalex.org/W1497062621","https://openalex.org/W1992000713"],"abstract_inverted_index":{"In":[0],"this":[1],"thesis":[2],"we":[3,45],"present":[4],"a":[5,54,62,78],"number":[6],"of":[7,13,53,65,102],"new":[8],"techniques":[9,87],"for":[10,39,106],"solving":[11],"many":[12],"the":[14,34,43,48,51,75,93,97,107],"fundamental":[15],"problems":[16,44],"in":[17,21,96],"computational":[18,113],"geometry":[19],"efficiently":[20],"parallel.":[22],"The":[23,86],"resulting":[24],"algorithms":[25,38],"all":[26],"have":[27],"linear":[28,31],"or":[29,110],"\"almost\"":[30],"speed-ups":[32],"over":[33],"best":[35],"known":[36],"sequential":[37,99],"these":[40],"problems.":[41],"Specifically,":[42],"address":[46],"include":[47],"following:":[49],"computing":[50],"diameter":[52],"convex":[55,58],"polygon,":[56],"planar":[57,83],"hull":[59],"finding,":[60,71],"finding":[61],"closest":[63],"pair":[64],"points,":[66],"polygon":[67],"triangulation,":[68],"3-dimensional":[69],"maxima":[70],"dominance":[72],"counting,":[73],"determining":[74],"visibility":[76],"from":[77,92],"point,":[79],"trapezoidal":[80],"decomposition,":[81],"and":[82],"point":[84],"location.":[85],"presented":[88],"are":[89,105],"quite":[90],"different":[91],"ones":[94],"used":[95],"efficient":[98],"algorithms.":[100],"All":[101],"our":[103],"results":[104],"CREW":[108],"PRAM":[109,112],"EREW":[111],"models.":[114]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}