{"id":"https://openalex.org/W2181371467","doi":"https://doi.org/10.2312/conf/eg2012/posters/025-026","title":"Minimising Longest Edge for Closed Surface Construction from Unorganised 3D Point Sets","display_name":"Minimising Longest Edge for Closed Surface Construction from Unorganised 3D Point Sets","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2181371467","doi":"https://doi.org/10.2312/conf/eg2012/posters/025-026","mag":"2181371467"},"language":"en","primary_location":{"id":"doi:10.2312/conf/eg2012/posters/025-026","is_oa":true,"landing_page_url":"https://doi.org/10.2312/conf/eg2012/posters/025-026","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":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/conf/eg2012/posters/025-026","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000854542","display_name":"Stefan Ohrhallinger","orcid":"https://orcid.org/0000-0002-2526-7700"},"institutions":[{"id":"https://openalex.org/I105925353","display_name":"Concordia University Wisconsin","ror":"https://ror.org/04k83g518","country_code":"US","type":"education","lineage":["https://openalex.org/I105925353"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ohrhallinger, Stefan","raw_affiliation_strings":["Concordia University Wisconsin, Mequon, United States"],"affiliations":[{"raw_affiliation_string":"Concordia University Wisconsin, Mequon, United States","institution_ids":["https://openalex.org/I105925353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047013969","display_name":"Sudhir P. Mudur","orcid":"https://orcid.org/0000-0003-4837-0118"},"institutions":[{"id":"https://openalex.org/I105925353","display_name":"Concordia University Wisconsin","ror":"https://ror.org/04k83g518","country_code":"US","type":"education","lineage":["https://openalex.org/I105925353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mudur, Sudhir","raw_affiliation_strings":["Concordia University Wisconsin, Mequon, United States"],"affiliations":[{"raw_affiliation_string":"Concordia University Wisconsin, Mequon, United States","institution_ids":["https://openalex.org/I105925353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000854542"],"corresponding_institution_ids":["https://openalex.org/I105925353"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"26"},"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","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/T10719","display_name":"3D Shape Modeling and Analysis","score":0.9997000098228455,"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.9990000128746033,"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/mathematics","display_name":"Mathematics","score":0.5222564339637756},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.4959498345851898},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4913126528263092},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.48401281237602234},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.4814697802066803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47259244322776794},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.471796452999115},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.46729353070259094},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4417649507522583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4131723642349243},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39550280570983887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.379814088344574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34367358684539795},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.32701021432876587},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13985499739646912},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13349926471710205}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222564339637756},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.4959498345851898},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4913126528263092},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.48401281237602234},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.4814697802066803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47259244322776794},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.471796452999115},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.46729353070259094},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4417649507522583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4131723642349243},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39550280570983887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.379814088344574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34367358684539795},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.32701021432876587},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13985499739646912},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13349926471710205},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2312/conf/eg2012/posters/025-026","is_oa":true,"landing_page_url":"https://doi.org/10.2312/conf/eg2012/posters/025-026","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:2181371467","is_oa":false,"landing_page_url":"https://www.cg.tuwien.ac.at/research/publications/2012/ohrhallinger_stefan-2012-mle/ohrhallinger_stefan-2012-mle-paper.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/conf/eg2012/posters/025-026","is_oa":true,"landing_page_url":"https://doi.org/10.2312/conf/eg2012/posters/025-026","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7799999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2069585823","https://openalex.org/W2147425564","https://openalex.org/W2171094068","https://openalex.org/W3127705606"],"related_works":["https://openalex.org/W2148103003","https://openalex.org/W2144175645","https://openalex.org/W405644169","https://openalex.org/W3200180077","https://openalex.org/W2594500719","https://openalex.org/W3119919475","https://openalex.org/W1571691002","https://openalex.org/W1964649293","https://openalex.org/W2124507191","https://openalex.org/W2121021477","https://openalex.org/W1488791567","https://openalex.org/W1522158825","https://openalex.org/W2027549499","https://openalex.org/W2044481069","https://openalex.org/W1850028945","https://openalex.org/W2087180168","https://openalex.org/W2090451920","https://openalex.org/W3101752134","https://openalex.org/W2114162555","https://openalex.org/W2162130997"],"abstract_inverted_index":{"Given":[0],"an":[1],"unorganised":[2],"3D":[3],"point":[4,133],"set":[5],"with":[6,114],"just":[7],"coordinate":[8],"data,":[9],"we":[10,37],"formulate":[11],"the":[12,39,46,54,102],"problem":[13],"of":[14,22,67,76],"closed":[15],"surface":[16,48],"construction":[17,117],"as":[18,118],"one":[19],"requiring":[20],"minimisation":[21],"longest":[23],"edge":[24,65],"in":[25,111],"triangles,":[26],"a":[27,83,88,98],"criterion":[28],"derivable":[29],"from":[30],"Gestalt":[31],"laws":[32],"for":[33,130],"shape":[34,92],"perception.":[35],"Next":[36],"define":[38],"Minimum":[40],"Boundary":[41],"Complex":[42],"(BCmin),":[43],"which":[44,93],"resembles":[45],"desired":[47,103],"Bmin":[49],"considerably,":[50],"by":[51,71,97],"slightly":[52],"relaxing":[53],"topological":[55],"constraint":[56],"to":[57,106],"make":[58],"it":[59],"at":[60],"least":[61],"two":[62,69],"triangles":[63],"per":[64],"instead":[66],"exactly":[68],"required":[70],"Bmin.":[72,107],"A":[73],"close":[74,105],"approximation":[75],"BCmin":[77],"can":[78,94],"be":[79,95],"computed":[80],"fast":[81],"using":[82],"greedy":[84],"algorithm.":[85],"This":[86],"provides":[87],"very":[89],"good":[90],"starting":[91],"transformed":[96],"few":[99],"steps":[100],"into":[101],"shape,":[104],"Our":[108],"method":[109],"runs":[110],"O(nlogn)":[112],"time,":[113],"Delaunay":[115],"Graph":[116],"largest":[119],"run-time":[120],"factor.":[121],"We":[122],"show":[123],"considerable":[124],"improvement":[125],"over":[126],"previous":[127],"methods,":[128],"especially":[129],"sparse,":[131],"non-uniform":[132],"spacing.":[134]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}