{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/21633"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/21633","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Simplifying and deforming through hierarchies of simplicial grids","abstract":"This thesis consists of three parts. In the first part we study the maintenance of a simplicial grid under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimension higher than the grid. The density of the grid is adapted by locally moving the cross-section up or down along the extra dimension. In the method was implemented for grids in two and three dimensions. In the second part we show an application of monotone simplicial complexes to the problem of constructing cartograms. In the third part we describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results are included.","abstract_html":"This thesis consists of three parts. In the first part we study the maintenance of a simplicial grid under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimension higher than the grid. The density of the grid is adapted by locally moving the cross-section up or down along the extra dimension. In the method was implemented for grids in two and three dimensions. In the second part we show an application of monotone simplicial complexes to the problem of constructing cartograms. In the third part we describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results are included.","abstract_has_math":false,"creators":["Waupotitsch, Roman"],"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":2011,"date_issued":"2011-05-07T13:14:31Z","date_published":"2011-05-07T13:14:31Z","updated_at":"2026-07-22T22:25:18Z","subjects":["Computer Science"],"languages":["eng"],"rights":["Copyright 1996 Waupotitsch, Roman"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9712479","(UMI)AAI9712479","9780591199611"],"render_values":[{"text":"AAI9712479","href":null,"code":true},{"text":"(UMI)AAI9712479","href":null,"code":true},{"text":"9780591199611","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/21633","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":["Waupotitsch, Roman"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T13:14:31Z","10000-01-01","1996"]},{"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"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1996 Waupotitsch, Roman"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/21633","AAI9712479","(UMI)AAI9712479","9780591199611"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis consists of three parts. In the first part we study the maintenance of a simplicial grid under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimension higher than the grid. The density of the grid is adapted by locally moving the cross-section up or down along the extra dimension. In the method was implemented for grids in two and three dimensions. In the second part we show an application of monotone simplicial complexes to the problem of constructing cartograms. In the third part we describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results are included.","Made available in DSpace on 2011-05-07T13:14:31Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712479.pdf: 4042137 bytes, checksum: 25f2231d9c144cdf0623b78b6f83fd6b (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:52:10Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:59-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Simplifying and deforming through hierarchies of simplicial grids"]}]}],"canonical_facts":{"dc:contributor":["Edelsbrunner, Herbert"],"dc:creator":["Waupotitsch, Roman"],"dc:date":["2011-05-07T13:14:31Z","10000-01-01","1996"],"dc:description":["This thesis consists of three parts. In the first part we study the maintenance of a simplicial grid under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimension higher than the grid. The density of the grid is adapted by locally moving the cross-section up or down along the extra dimension. In the method was implemented for grids in two and three dimensions. In the second part we show an application of monotone simplicial complexes to the problem of constructing cartograms. In the third part we describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results are included.","Made available in DSpace on 2011-05-07T13:14:31Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9712479.pdf: 4042137 bytes, checksum: 25f2231d9c144cdf0623b78b6f83fd6b (MD5) Previous issue date: 1996","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:52:10Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:23:59-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["http://hdl.handle.net/2142/21633","AAI9712479","(UMI)AAI9712479","9780591199611"],"dc:language":["eng"],"dc:rights":["Copyright 1996 Waupotitsch, Roman"],"dc:subject":["Computer Science"],"dc:title":["Simplifying and deforming through hierarchies of simplicial grids"],"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:25:18Z"}