{"id":"https://openalex.org/W2123869145","doi":"https://doi.org/10.1137/s0097539791223747","title":"Computing and Verifying Depth Orders","display_name":"Computing and Verifying Depth Orders","publication_year":1994,"publication_date":"1994-04-01","ids":{"openalex":"https://openalex.org/W2123869145","doi":"https://doi.org/10.1137/s0097539791223747","mag":"2123869145"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791223747","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791223747","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/fe632cad-4e72-4082-bc48-88647cfcdb21","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109262027","display_name":"Mark Overmars","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark Overmars","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107832533","display_name":"Otfried Schwarzkopf","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Otfried Schwarzkopf","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":3.937,"has_fulltext":true,"cited_by_count":45,"citation_normalized_percentile":{"value":0.93372178,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"23","issue":"2","first_page":"437","last_page":"446"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9916999936103821,"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/computer-science","display_name":"Computer science","score":0.5390152335166931},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39606133103370667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37839025259017944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35181283950805664},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.346504807472229}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5390152335166931},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39606133103370667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37839025259017944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35181283950805664},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.346504807472229}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539791223747","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791223747","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/fe632cad-4e72-4082-bc48-88647cfcdb21","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/fe632cad-4e72-4082-bc48-88647cfcdb21","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M, Overmars, M H & Schwarzkopf, O 1994, 'Computing and verifying depth orders', SIAM Journal on Computing, vol. 23, no. 2, pp. 437-446. https://doi.org/10.1137/S0097539791223747","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/fe632cad-4e72-4082-bc48-88647cfcdb21","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/fe632cad-4e72-4082-bc48-88647cfcdb21","pdf_url":"https://research.tue.nl/nl/publications/fe632cad-4e72-4082-bc48-88647cfcdb21","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 23(2), 437 - 446. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.573.1421","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.573.1421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://graphics.stanford.edu/courses/cs468-01-winter/papers/bos-cvdo-94.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/fe632cad-4e72-4082-bc48-88647cfcdb21","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/fe632cad-4e72-4082-bc48-88647cfcdb21","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M, Overmars, M H & Schwarzkopf, O 1994, 'Computing and verifying depth orders', SIAM Journal on Computing, vol. 23, no. 2, pp. 437-446. https://doi.org/10.1137/S0097539791223747","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1982136379","https://openalex.org/W1983698126","https://openalex.org/W2009244266","https://openalex.org/W2010761427","https://openalex.org/W2054927768","https://openalex.org/W2080587325","https://openalex.org/W2098091090","https://openalex.org/W2106413026","https://openalex.org/W2123945761","https://openalex.org/W2140020980","https://openalex.org/W2196955596","https://openalex.org/W2278560942"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644"],"abstract_inverted_index":{"A":[0],"depth":[1,58],"order":[2,13,26],"on":[3,147],"a":[4,18,28,39,99,148],"set":[5],"of":[6,57,60,62,102,141],"line":[7,16,21,64,90,142],"segments":[8,65,91],"in":[9,24,33,66,73,110],"3-space":[10,67],"is":[11,38],"an":[12],"such":[14],"that":[15,42],"segment":[17,22],"comes":[19],"before":[20],"$a'$":[23,31,45],"the":[25,53,106,122],"when":[27,36],"lies":[29],"below":[30],"or,":[32,94],"other":[34,138],"words,":[35],"there":[37],"vertical":[40],"ray":[41],"first":[43],"intersects":[44,48],"and":[46,55,121,137,153],"then":[47,105],"a.":[49],"Efficient":[50],"algorithms":[51,71,130],"for":[52,82,114,151],"computation":[54],"verification":[56,123],"orders":[59,156],"sets":[61],"n":[63],"are":[68,92,145],"presented.":[69],"The":[70,129],"run":[72],"time":[74,120],"$O(n^{{4":[75],"/":[76],"3}":[77],"+":[78],"\\varepsilon":[79],"}":[80],")$,":[81],"any":[83,115],"fixed":[84,116],"$\\varepsilon":[85,117],">":[86,118],"0$.":[87],"If":[88],"all":[89],"axis-parallel":[93],"more":[95],"generally,":[96],"have":[97],"only":[98],"constant":[100],"number":[101],"different":[103],"orientations,":[104],"sorting":[107],"algorithm":[108],"runs":[109],"$O(n\\log":[111,125],"^3":[112],"n)$,":[113],"0$":[119],"takes":[124],"^2":[126],"n)$":[127],"time.":[128],"can":[131],"be":[132],"generalized":[133],"to":[134],"handle":[135],"triangles":[136],"polygons":[139],"instead":[140],"segments.":[143],"They":[144],"based":[146],"general":[149],"framework":[150],"computing":[152],"verifying":[154],"linear":[155],"extending":[157],"implicitly":[158],"defined":[159],"binary":[160],"relations.":[161]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"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"}