{"id":"https://openalex.org/W1526854921","doi":"https://doi.org/10.2312/eggh/eggh87/065-073","title":"An O(log N) Parallel Time Exact Hidden-LineAlgorithm","display_name":"An O(log N) Parallel Time Exact Hidden-LineAlgorithm","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W1526854921","doi":"https://doi.org/10.2312/eggh/eggh87/065-073","mag":"1526854921"},"language":"en","primary_location":{"id":"doi:10.2312/eggh/eggh87/065-073","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh87/065-073","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/eggh/eggh87/065-073","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068502470","display_name":"Frank D\u00e9vai","orcid":"https://orcid.org/0000-0003-1825-495X"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e9vai, F.","raw_affiliation_strings":["Computer & Automation Inst., Hungarian Academy of Sciences, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Computer & Automation Inst., Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068502470"],"corresponding_institution_ids":["https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"73"},"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.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9923999905586243,"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-algorithm","display_name":"Parallel algorithm","score":0.6882018446922302},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6423133015632629},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5663385391235352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5484585762023926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5421423316001892},{"id":"https://openalex.org/keywords/aliasing","display_name":"Aliasing","score":0.4960061013698578},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4901066720485687},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4722784459590912},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4498240351676941},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.4179840385913849},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4163692593574524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3817157447338104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3185296654701233},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.30998775362968445}],"concepts":[{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6882018446922302},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6423133015632629},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5663385391235352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5484585762023926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5421423316001892},{"id":"https://openalex.org/C4069607","wikidata":"https://www.wikidata.org/wiki/Q868732","display_name":"Aliasing","level":3,"score":0.4960061013698578},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4901066720485687},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4722784459590912},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4498240351676941},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.4179840385913849},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4163692593574524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3817157447338104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3185296654701233},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.30998775362968445},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2312/eggh/eggh87/065-073","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh87/065-073","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:1526854921","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/egh/egh1987.html#Devai87","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Eurographics","raw_type":null}],"best_oa_location":{"id":"doi:10.2312/eggh/eggh87/065-073","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh87/065-073","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W24647538","https://openalex.org/W1551221054","https://openalex.org/W1655990431","https://openalex.org/W1666015432","https://openalex.org/W1967567484","https://openalex.org/W1972938379","https://openalex.org/W1977926680","https://openalex.org/W1991651582","https://openalex.org/W2006428252","https://openalex.org/W2020007061","https://openalex.org/W2027501230","https://openalex.org/W2032596233","https://openalex.org/W2038599141","https://openalex.org/W2056916787","https://openalex.org/W2066523928","https://openalex.org/W2076458424","https://openalex.org/W2077449861","https://openalex.org/W2083632529","https://openalex.org/W2089965917","https://openalex.org/W2106145571","https://openalex.org/W2114968863","https://openalex.org/W2123335580","https://openalex.org/W2143264448","https://openalex.org/W2150633580","https://openalex.org/W2154841872","https://openalex.org/W2283720639","https://openalex.org/W3005308876"],"related_works":["https://openalex.org/W2064923761","https://openalex.org/W1498557394","https://openalex.org/W23339264","https://openalex.org/W434863569","https://openalex.org/W2091384568","https://openalex.org/W2768169247","https://openalex.org/W2930422516","https://openalex.org/W2464065967","https://openalex.org/W2050218830","https://openalex.org/W2207541471","https://openalex.org/W1791765379","https://openalex.org/W2963301401","https://openalex.org/W2251565100","https://openalex.org/W2731979530","https://openalex.org/W2950625263","https://openalex.org/W2268911554","https://openalex.org/W2518339813","https://openalex.org/W2196926259","https://openalex.org/W2567804199","https://openalex.org/W3118649333"],"abstract_inverted_index":{"\"Parallel":[0],"algorithms":[1,16],"are":[2,215],"given":[3,195],"for":[4,18,51],"the":[5,9,14,22,35,38,79,90,102,109,115,123,127,150,153,157],"exact":[6],"solution":[7,193],"of":[8,13,37,60,65,81,92,101,126,133,175,184,206],"hidden-line":[10,128],"problem.":[11,40,129],"Most":[12],"parallel":[15,124,151,185,191,212],"proposed":[17,44],"visibility":[19],"problems":[20],"in":[21,149,156,166,169,178],"literature":[23],"give":[24],"approximate":[25],"solutions.":[26],"and":[27,143],"thus":[28],"cannot":[29,197],"yield":[30],"an":[31,189],"upper":[32],"bound":[33],"on":[34,108,114],"complexity":[36,125,132,158],"particular":[39],"The":[41,130],"first":[42,110],"algorithm":[43],"here":[45],"is":[46,69,78,98,106,112,119,155,194],"worth":[47],"mentioning":[48],"not":[49],"only":[50],"its":[52],"simplicity.":[53],"but":[54],"also":[55],"from":[56],"a":[57,62,66,86,173,207],"practical":[58],"point":[59],"view:":[61],"speed":[63],"up":[64],"factor":[67],"P":[68,73],"achieved":[70],"by":[71,171],"using":[72,172],"processors.":[74],"l\"\";;P\"\";;N.":[75],"where":[76],"N":[77],"number":[80,174],"edges":[82],"used":[83,120],"to":[84,121,140],"describe":[85],"polygonal":[87],"scene.":[88],"Additionally.":[89],"problem":[91,135,154],"aliasing":[93],"inherent":[94],"with":[95],"approximation":[96],"methods":[97],"avoided.The":[99],"significance":[100],"second":[103],"algorithm,":[104],"which":[105,196],"based":[107],"one,":[111],"mainly":[113],"theoretical":[116],"level:":[117],"it":[118,162],"establish":[122],"sequential":[131],"this":[134],"has":[136],"recently":[137],"been":[138],"proved":[139],"be":[141,164,198],"e(N2).":[142],"now":[144],"we":[145],"can":[146,163],"prove":[147],"that":[148],"case":[152],"class":[159],"NC,":[160],"Le.,":[161],"solved":[165],"time":[167,192],"polynomial":[168,177],"logN":[170],"processors":[176,205],"N,":[179],"assuming":[180],"any":[181],"reasonable":[182],"model":[183,214],"computation.":[186],"More":[187],"particularly,":[188],"O(logN)":[190],"further":[199],"improved":[200],"even":[201],"if":[202],"arbitrarily":[203],"many":[204],"concurrent":[208],"read,":[209],"exclusive":[210],"write":[211],"RAM":[213],"available.\"":[216]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}