{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81580"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81580","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Tetrahedral Mesh Improvement, Algorithms and Experiments","abstract":"The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.","abstract_html":"The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.","abstract_has_math":false,"creators":["Guoy, Damrong"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Edelsbrunner, Herbert"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:17Z","date_published":"2015-09-25T20:19:17Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3023067"],"render_values":[{"text":"(MiAaPQ)AAI3023067","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81580","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Edelsbrunner, Herbert"]},{"key":"dc:creator","label":"Author","values":["Guoy, Damrong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:17Z","10000-01-01","2001"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81580","(MiAaPQ)AAI3023067"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.","Made available in DSpace on 2015-09-25T20:19:17Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3023067.pdf: 5970537 bytes, checksum: e52fbedcf30b187346ee174ec1891667 (MD5) Previous issue date: 2001","Embargo set by: Seth Robbins for item 82861 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","111 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001."]},{"key":"dc:title","label":"Title","values":["Tetrahedral Mesh Improvement, Algorithms and Experiments"]}]}],"canonical_facts":{"dc:contributor":["Edelsbrunner, Herbert"],"dc:creator":["Guoy, Damrong"],"dc:date":["2015-09-25T20:19:17Z","10000-01-01","2001"],"dc:description":["The persistent appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted Delaunay mesh. This is referred to as the sliver exudation algorithm. Their theoretical bound on the achieved minimum mesh quality is a constant that is positive but exceedingly small. We perform computational experiments to testify the practical effectiveness of sliver exudation.","Made available in DSpace on 2015-09-25T20:19:17Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3023067.pdf: 5970537 bytes, checksum: e52fbedcf30b187346ee174ec1891667 (MD5) Previous issue date: 2001","Embargo set by: Seth Robbins for item 82861 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","111 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001."],"dc:identifier":["http://hdl.handle.net/2142/81580","(MiAaPQ)AAI3023067"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Tetrahedral Mesh Improvement, Algorithms and Experiments"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}