{"id":"https://openalex.org/W2945387729","doi":"https://doi.org/10.1007/s00454-019-00102-0","title":"Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments","display_name":"Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments","publication_year":2019,"publication_date":"2019-05-23","ids":{"openalex":"https://openalex.org/W2945387729","doi":"https://doi.org/10.1007/s00454-019-00102-0","mag":"2945387729"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-019-00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-019-00102-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-019-00102-0.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-019-00102-0.pdf","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/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Computer Science, TU Eindhoven, P.O.\u00a0Box 513, 5600 MB, Eindhoven, The Netherlands","Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Eindhoven, P.O.\u00a0Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.6709,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74191149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"65","issue":"2","first_page":"450","last_page":"469"},"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.9997000098228455,"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.9997000098228455,"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/T10601","display_name":"Handwritten Text Recognition Techniques","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T14339","display_name":"Image Processing and 3D Reconstruction","score":0.9921000003814697,"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/algorithm","display_name":"Algorithm","score":0.6548248529434204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3560663163661957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33448266983032227}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6548248529434204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3560663163661957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33448266983032227}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00454-019-00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-019-00102-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-019-00102-0.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/6a44f606-e671-442a-aaf9-6e603a539881","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6a44f606-e671-442a-aaf9-6e603a539881","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":"de Berg, M 2021, 'Removing depth-order cycles among triangles : an algorithm generating triangular fragments', Discrete and Computational Geometry, vol. 65, no. 2, pp. 450-469. https://doi.org/10.1007/s00454-019-00102-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6a44f606-e671-442a-aaf9-6e603a539881","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/6a44f606-e671-442a-aaf9-6e603a539881","pdf_url":null,"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":"Discrete and Computational Geometry, 65(2), 450 - 469. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00454-019-00102-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-019-00102-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-019-00102-0.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete &amp; Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2945387729.pdf","grobid_xml":"https://content.openalex.org/works/W2945387729.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1570805656","https://openalex.org/W1969196471","https://openalex.org/W1983698126","https://openalex.org/W1985412388","https://openalex.org/W1990755899","https://openalex.org/W2010761427","https://openalex.org/W2026200800","https://openalex.org/W2027387410","https://openalex.org/W2045155153","https://openalex.org/W2048215675","https://openalex.org/W2059155916","https://openalex.org/W2062612774","https://openalex.org/W2120039945","https://openalex.org/W2123869145","https://openalex.org/W2144713886","https://openalex.org/W2149693294","https://openalex.org/W2149906774","https://openalex.org/W2154261411","https://openalex.org/W2158848706","https://openalex.org/W2171708854","https://openalex.org/W2343027471","https://openalex.org/W2751884597","https://openalex.org/W2906548559","https://openalex.org/W2952134317","https://openalex.org/W2962961582","https://openalex.org/W3103597139","https://openalex.org/W3138103828","https://openalex.org/W4251391716","https://openalex.org/W4253926061"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"Abstract":[0],"More":[1],"than":[2],"25":[3],"years":[4],"ago,":[5],"inspired":[6],"by":[7,111,263,434],"applications":[8],"in":[9,32,109,226,275,442],"computer":[10],"graphics,":[11],"Chazelle":[12],"et":[13,155],"al.":[14,156],"studied":[15],"the":[16,52,83,90,194,197,204,209,256,352,359,362,366,446],"following":[17,205],"question:":[18],"is":[19,211,215,326],"it":[20,216],"possible":[21,217],"to":[22,61,192,218,420,428],"cut":[23,219],"any":[24,146,220,269],"set":[25,147,270],"of":[26,48,85,94,97,148,208,222,242,271,323,356,361,438],"n":[27,223,272],"lines":[28],"or":[29],"other":[30],"objects":[31],"$${\\mathbb":[33,227,276],"R}^3$$":[34,228,277],"<mml:math":[35,65,119,161,229,278,289,328,377],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[36,66,120,162,230,279,290,329,378],"<mml:msup>":[37,70,124,166,231,280,294,333,382,391,399],"<mml:mrow>":[38,67,72,121,126,132,163,168,232,281,291,296,302,330,335,379,384,393,401,407],"<mml:mi>R</mml:mi>":[39,233,282],"</mml:mrow>":[40,76,79,130,138,141,174,177,234,283,300,308,311,337,340,388,397,405,413,416],"<mml:mn>3</mml:mn>":[41,127,169,235,284,402],"</mml:msup>":[42,77,131,175,236,285,301,338,389,398,406],"</mml:math>":[43,80,142,178,237,286,312,341,417],"into":[44,238,287],"a":[45,56,107,151,239,247,317,346,422,435],"subquadratic":[46,240,448],"number":[47,84,241,437],"fragments":[49,54,143,244,314,418],"such":[50],"that":[51,117,245,267,315,349,371],"resulting":[53,198],"admit":[55,246,316],"depth":[57,248,318,423],"order?":[58,249],"They":[59],"managed":[60],"prove":[62,345],"an":[63,158,265],"$$O(n^{9/5})$$":[64],"<mml:mi>O</mml:mi>":[68,122,164,292,331,380],"<mml:mo>(</mml:mo>":[69,123,165,293,332,381],"<mml:mi>n</mml:mi>":[71,125,139,167,295,309,334,383,392,414],"<mml:mn>9</mml:mn>":[73],"<mml:mo>/</mml:mo>":[74,128,170,298,395,403],"<mml:mn>5</mml:mn>":[75],"<mml:mo>)</mml:mo>":[78,140,176,310,339,415],"bound":[81,179,348,449],"on":[82,351],"fragments,":[86],"but":[87,182],"only":[88,101],"for":[89,145,180,450],"very":[91],"special":[92],"case":[93],"bipartite":[95],"weavings":[96],"lines.":[98,149],"Since":[99],"then":[100],"little":[102],"progress":[103],"was":[104],"made,":[105],"until":[106],"breakthrough":[108],"2016":[110],"Aronov":[112,154],"and":[113],"Sharir,":[114],"who":[115],"showed":[116],"$$O(n^{3/2}{{\\,\\mathrm{polylog}\\,}}n)$$":[118],"<mml:mn>2</mml:mn>":[129,171],"<mml:mspace":[133,136,303,306,408,411],"/>":[134,137,304,307,409,412],"<mml:mi>polylog</mml:mi>":[135,305,410],"suffice":[144,419],"In":[150],"follow-up":[152],"paper":[153],"proved":[157],"$$O(n^{3/2+\\varepsilon":[159],"})$$":[160],"<mml:mo>+</mml:mo>":[172,386,390],"<mml:mi>\u03b5</mml:mi>":[173,387],"triangles,":[181],"their":[183],"method":[184],"uses":[185],"high-":[186],"(albeit":[187],"constant-)":[188],"degree":[189],"algebraic":[190,440],"arcs":[191,441],"perform":[193],"cuts.":[195],"Hence,":[196],"pieces":[199],"have":[200],"curved":[201],"boundaries.":[202],"Thus":[203],"natural":[206],"version":[207],"problem":[210],"still":[212],"wide":[213],"open:":[214],"collection":[221],"disjoint":[224,273],"triangles":[225,274],"triangular":[243,313],"And":[250],"if":[251],"so,":[252],"can":[253],"we":[254,369],"compute":[255],"cuts":[257,268],"efficiently?":[258],"We":[259,343],"answer":[260],"this":[261],"question":[262],"presenting":[264],"algorithm":[266,325],"$$O(n^{7/4}{{\\,\\mathrm{polylog}\\,}}n)$$":[288],"<mml:mn>7</mml:mn>":[297],"<mml:mn>4</mml:mn>":[299,396,404],"order.":[319,424],"The":[320],"running":[321],"time":[322],"our":[324],"$$O(n^{3.69})$$":[327],"<mml:mn>3.69</mml:mn>":[336],".":[342],"also":[344],"refined":[347],"depends":[350],"number,":[353],"K":[354],",":[355],"intersections":[357],"between":[358],"projections":[360],"triangle":[363],"edges":[364],"onto":[365],"xy":[367,429],"-plane:":[368],"show":[370],"$$O(n^{1+\\varepsilon":[372],"}":[373],"+":[374],"n^{1/4}":[375],"K^{3/4}{{\\,\\mathrm{polylog}\\,}}n)$$":[376],"<mml:mn>1</mml:mn>":[385,394],"<mml:mi>K</mml:mi>":[400],"obtain":[421],"This":[425],"result":[426],"extends":[427],"-monotone":[430],"surface":[431,451],"patches":[432],"bounded":[433],"constant":[436],"bounded-degree":[439],"general":[443],"position,":[444],"constituting":[445],"first":[447],"patches.":[452]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}