{"id":"https://openalex.org/W2169692949","doi":"https://doi.org/10.2312/egs.20031052","title":"An Iterative Stripification Algorithm Based on Dual Graph Operations","display_name":"An Iterative Stripification Algorithm Based on Dual Graph Operations","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2169692949","doi":"https://doi.org/10.2312/egs.20031052","mag":"2169692949"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.6484","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.6484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ugo.sc.unica.it/papers/Porcu2003AIS.pdf","raw_type":"text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egs.20031052","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102256521","display_name":"Massimiliano B. Porcu","orcid":null},"institutions":[{"id":"https://openalex.org/I172446870","display_name":"University of Cagliari","ror":"https://ror.org/003109y17","country_code":"IT","type":"education","lineage":["https://openalex.org/I172446870"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Porcu, Massimiliano B.","raw_affiliation_strings":["University of Cagliari, Cagliari, Italy"],"affiliations":[{"raw_affiliation_string":"University of Cagliari, Cagliari, Italy","institution_ids":["https://openalex.org/I172446870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003406070","display_name":"Riccardo Scateni","orcid":"https://orcid.org/0000-0002-0950-7372"},"institutions":[{"id":"https://openalex.org/I172446870","display_name":"University of Cagliari","ror":"https://ror.org/003109y17","country_code":"IT","type":"education","lineage":["https://openalex.org/I172446870"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Scateni, Riccardo","raw_affiliation_strings":["University of Cagliari, Cagliari, Italy"],"affiliations":[{"raw_affiliation_string":"University of Cagliari, Cagliari, Italy","institution_ids":["https://openalex.org/I172446870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102256521"],"corresponding_institution_ids":["https://openalex.org/I172446870"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"69","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","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/T10481","display_name":"Computer Graphics and Visualization Techniques","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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/strips","display_name":"STRIPS","score":0.8964583873748779},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.6262413859367371},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.6055327653884888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5980960130691528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5805923938751221},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5617661476135254},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5380041599273682},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49483269453048706},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30171918869018555},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2617405652999878},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2042081356048584},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.13155597448349}],"concepts":[{"id":"https://openalex.org/C200925200","wikidata":"https://www.wikidata.org/wiki/Q7624170","display_name":"STRIPS","level":2,"score":0.8964583873748779},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.6262413859367371},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.6055327653884888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5980960130691528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5805923938751221},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5617661476135254},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5380041599273682},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49483269453048706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30171918869018555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2617405652999878},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2042081356048584},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.13155597448349},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.6484","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.6484","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ugo.sc.unica.it/papers/Porcu2003AIS.pdf","raw_type":"text"},{"id":"doi:10.2312/egs.20031052","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egs.20031052","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:2169692949","is_oa":false,"landing_page_url":"https://people.unica.it/riccardoscateni/files/2013/07/Porcu2003AIS.pdf","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/egs.20031052","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egs.20031052","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":20,"referenced_works":["https://openalex.org/W330576842","https://openalex.org/W1590549688","https://openalex.org/W1636026099","https://openalex.org/W1967385755","https://openalex.org/W1977581205","https://openalex.org/W1989001601","https://openalex.org/W1991291335","https://openalex.org/W1999355997","https://openalex.org/W2006714486","https://openalex.org/W2042948670","https://openalex.org/W2046770738","https://openalex.org/W2060242115","https://openalex.org/W2084615300","https://openalex.org/W2087818742","https://openalex.org/W2134859956","https://openalex.org/W2142636632","https://openalex.org/W2238788188","https://openalex.org/W2293404936","https://openalex.org/W2293644818","https://openalex.org/W2329349624"],"related_works":["https://openalex.org/W1636026099","https://openalex.org/W2100733474","https://openalex.org/W2134859956","https://openalex.org/W2052789583","https://openalex.org/W2293404936","https://openalex.org/W2084615300","https://openalex.org/W1967385755","https://openalex.org/W1519407296","https://openalex.org/W2060242115","https://openalex.org/W1999355997","https://openalex.org/W1525898581","https://openalex.org/W2369010135","https://openalex.org/W1556038923","https://openalex.org/W330576842","https://openalex.org/W2085389919","https://openalex.org/W2046770738","https://openalex.org/W1989001601","https://openalex.org/W1913016734","https://openalex.org/W2102269381","https://openalex.org/W2151586071"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"the":[3,31,35,47,83,90,93,97,101],"preliminary":[4],"results":[5],"obtained":[6],"using":[7],"an":[8,39],"iterative":[9],"method":[10,52],"for":[11,63,82,100],"generating":[12],"a":[13,19,26,54,58,78],"set":[14],"of":[15,21,34,49,57,77,92],"triangle":[16,106],"strips":[17,84,107],"from":[18],"mesh":[20],"triangles.":[22],"The":[23,75],"algorithm":[24],"uses":[25],"simple":[27],"topological":[28],"operation":[29],"on":[30],"dual":[32],"graph":[33,98],"mesh,":[36],"to":[37,87],"generate":[38],"initial":[40],"stripification":[41],"and":[42,45,66,71,103,112],"iteratively":[43],"rearrange":[44],"decrease":[46],"number":[48],"strips.":[50],"Our":[51],"is":[53],"major":[55],"improvement":[56],"proposed":[59],"one":[60],"originally":[61],"devised":[62],"both":[64],"static":[65],"continuous":[67],"level-of-detail":[68],"(CLOD)":[69],"meshes":[70],"retains":[72],"this":[73],"feature.":[74],"usage":[76],"dynamical":[79],"identification":[80],"strategy":[81],"allows":[85],"us":[86],"drastically":[88],"reduce":[89],"length":[91],"searching":[94],"paths":[95],"in":[96],"needed":[99],"rearrangement":[102],"produce":[104],"loop-free":[105],"without":[108],"any":[109],"further":[110],"controls":[111],"post-processing.":[113]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}