{"id":"https://openalex.org/W3214675104","doi":"https://doi.org/10.3390/a17040137","title":"Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds","display_name":"Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds","publication_year":2024,"publication_date":"2024-03-27","ids":{"openalex":"https://openalex.org/W3214675104","doi":"https://doi.org/10.3390/a17040137","mag":"3214675104"},"language":"en","primary_location":{"id":"doi:10.3390/a17040137","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040137","pdf_url":"https://www.mdpi.com/1999-4893/17/4/137/pdf?version=1711531197","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/4/137/pdf?version=1711531197","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035127705","display_name":"Nenad Marku\u0161","orcid":"https://orcid.org/0000-0002-4689-0956"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":true,"raw_author_name":"Nenad Marku\u0161","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"],"raw_orcid":"https://orcid.org/0000-0002-4689-0956","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019634121","display_name":"Mirko Su\u017enjevi\u0107","orcid":"https://orcid.org/0000-0003-0334-8179"},"institutions":[{"id":"https://openalex.org/I181343428","display_name":"University of Zagreb","ror":"https://ror.org/00mv6sv71","country_code":"HR","type":"education","lineage":["https://openalex.org/I181343428"]}],"countries":["HR"],"is_corresponding":true,"raw_author_name":"Mirko Su\u017enjevi\u0107","raw_affiliation_strings":["Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"],"raw_orcid":"https://orcid.org/0000-0003-0334-8179","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia","institution_ids":["https://openalex.org/I181343428"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019634121","https://openalex.org/A5035127705"],"corresponding_institution_ids":["https://openalex.org/I181343428"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00123896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"4","first_page":"137","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6064044237136841},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48302826285362244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4397753179073334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3988584280014038}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6064044237136841},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48302826285362244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4397753179073334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3988584280014038}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a17040137","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040137","pdf_url":"https://www.mdpi.com/1999-4893/17/4/137/pdf?version=1711531197","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2111.05778","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2111.05778","pdf_url":"https://arxiv.org/pdf/2111.05778","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:4e42e0e689f24d7a8b24d73cefe0f8be","is_oa":false,"landing_page_url":"https://doaj.org/article/4e42e0e689f24d7a8b24d73cefe0f8be","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 4, p 137 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17040137","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040137","pdf_url":"https://www.mdpi.com/1999-4893/17/4/137/pdf?version=1711531197","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4324861012","display_name":null,"funder_award_id":"101103592","funder_id":"https://openalex.org/F4320318377","funder_display_name":"European Defence Fund"}],"funders":[{"id":"https://openalex.org/F4320318377","display_name":"European Defence Fund","ror":null},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3214675104.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1993244675","https://openalex.org/W2022845624","https://openalex.org/W2111734174","https://openalex.org/W2112887636","https://openalex.org/W2125039738","https://openalex.org/W2129069237","https://openalex.org/W2142499637","https://openalex.org/W2229412420","https://openalex.org/W2396935036","https://openalex.org/W2901893665","https://openalex.org/W2962849139","https://openalex.org/W2963627347","https://openalex.org/W3035689117","https://openalex.org/W3088938682","https://openalex.org/W3099524026","https://openalex.org/W3121736960","https://openalex.org/W3156282961","https://openalex.org/W3168213033","https://openalex.org/W3184957317","https://openalex.org/W3209106268","https://openalex.org/W4230159453","https://openalex.org/W4296957573"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Recently,":[0],"there":[1],"has":[2],"been":[3],"renewed":[4],"interest":[5],"in":[6,37,43,153],"signed":[7,56,117],"distance":[8,57,118],"bound":[9],"representations":[10],"due":[11],"to":[12,33],"their":[13],"unique":[14],"properties":[15],"for":[16,25,54,98,156],"3D":[17],"shape":[18,154],"modelling.":[19],"This":[20,62],"is":[21,31,63,92,107],"especially":[22],"the":[23,67,94,147],"case":[24],"deep":[26],"learning-based":[27],"bounds.":[28],"However,":[29],"it":[30,142],"beneficial":[32],"work":[34],"with":[35,75,102],"polygons":[36],"most":[38],"computer":[39],"graphics":[40],"applications.":[41],"Thus,":[42],"this":[44,90],"paper,":[45],"we":[46,139],"introduce":[47],"and":[48,86,116,137],"investigate":[49],"an":[50],"asymptotically":[51],"fast":[52],"method":[53],"transforming":[55],"bounds":[58,119],"into":[59],"polygon":[60],"meshes.":[61],"achieved":[64],"by":[65,124],"combining":[66],"principles":[68],"of":[69,93,113],"sphere":[70],"tracing":[71],"(or":[72],"ray":[73],"marching)":[74],"traditional":[76],"polygonization":[77,100],"techniques,":[78],"such":[79],"as":[80,129,150,152],"marching":[81],"cubes.":[82],"We":[83],"provide":[84],"theoretical":[85],"experimental":[87],"evidence":[88],"that":[89,141],"approach":[91],"O(N2logN)":[95],"computational":[96],"complexity":[97],"a":[99,111],"grid":[101],"N3":[103],"cells.":[104],"The":[105],"algorithm":[106],"tested":[108],"on":[109],"both":[110],"set":[112],"primitive":[114],"shapes":[115],"generated":[120],"from":[121],"point":[122],"clouds":[123],"machine":[125],"learning":[126],"(and":[127],"represented":[128],"neural":[130],"networks).":[131],"Given":[132],"its":[133],"speed,":[134],"implementation":[135],"simplicity,":[136],"portability,":[138],"argue":[140],"could":[143],"prove":[144],"useful":[145],"during":[146],"modelling":[148],"stage":[149],"well":[151],"compression":[155],"storage.":[157]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2021-11-22T00:00:00"}