{"id":"https://openalex.org/W6926318288","doi":"https://doi.org/10.2312/sgp/sgp04/229-240","title":"Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces","display_name":"Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W6926318288","doi":"https://doi.org/10.2312/sgp/sgp04/229-240"},"language":"en","primary_location":{"id":"doi:10.2312/sgp/sgp04/229-240","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sgp/sgp04/229-240","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":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/sgp/sgp04/229-240","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Carr, Nathan A.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Carr, Nathan A.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hart, John C.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hart, John C.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.02710000053048134,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.02710000053048134,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13062","display_name":"Cognitive Computing and Networks","score":0.01549999974668026,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.014100000262260437,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/polygon-mesh","display_name":"Polygon mesh","score":0.7067999839782715},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5590999722480774},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.5404000282287598},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5098999738693237},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4456000030040741},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43470001220703125},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4327999949455261},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.3847000002861023}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7261999845504761},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7067999839782715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100999712944031},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5590999722480774},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.5404000282287598},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4456000030040741},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4327999949455261},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C194401833","wikidata":"https://www.wikidata.org/wiki/Q3456889","display_name":"Triangle mesh","level":3,"score":0.36149999499320984},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33390000462532043},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C181145010","wikidata":"https://www.wikidata.org/wiki/Q4418033","display_name":"Mesh generation","level":3,"score":0.28110000491142273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/sgp/sgp04/229-240","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sgp/sgp04/229-240","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"}],"best_oa_location":{"id":"doi:10.2312/sgp/sgp04/229-240","is_oa":true,"landing_page_url":"https://doi.org/10.2312/sgp/sgp04/229-240","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Numerous":[0],"mesh":[1,30,56],"algorithms":[2,66],"such":[3],"as":[4],"parametrization,":[5],"radiosity,":[6],"and":[7],"collision":[8],"detection":[9],"require":[10],"the":[11],"decomposition":[12,57],"of":[13,18,62,77,83],"meshes":[14],"into":[15],"a":[16,40,47,55,59,84],"series":[17],"clusters.":[19,63],"In":[20],"this":[21],"paper":[22],"we":[23,67],"present":[24],"two":[25],"novel":[26],"approaches":[27],"for":[28,58],"maintaining":[29],"clusterings":[31,72],"on":[32,73],"dynamically":[33,74],"deforming":[34,75],"meshes.":[35],"The":[36,51],"first":[37],"approach":[38],"maintains":[39,54],"complete":[41],"face":[42],"cluster":[43],"tree":[44],"hierarchy":[45],"using":[46],"randomized":[48],"data":[49],"structure.":[50],"second":[52],"algorithm":[53],"fixed":[60],"set":[61],"With":[64],"both":[65],"are":[68],"able":[69],"to":[70],"maintain":[71],"surfaces":[76],"over":[78],"100K":[79],"faces":[80],"in":[81],"fractions":[82],"second.":[85]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}