{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/104936"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/104936","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions","abstract":"We introduce the spacetime discontinuous Galerkin method and motivate the need for supporting spacetime meshing on meshes comprised of multiple manifolds. We first discuss preliminary concepts behind simplices, simplicial complexes, and the generalization to oriented simplicies. Using these ideas, we define stratified spaces and how they can be used to model a mesh comprised of multiple oriented manifolds. We construct a graphical representation called a Stratified Mesh and use this representation to construct a collection of data structures, the main result being the StratifiedMesh data structure. Next we define a set of support algorithms based on the various data structures discussed. This leads us to review the fundamentals of the TentPitcher algorithm and its relationship to spacetime discontinuous Galerkin methods both theoretically and in the literature. The TentPitcher algorithm is then extended to work on stratified meshes in E^d x R for arbitrary spatial dimension d. We then briefly discuss a parametrization for tentpole vertices that generalizes the baseline TentPitcher, vertex smoothing, and tilted tentpoles. Following that, we discuss at a high level the generic software architecture and techniques used build completely new spacetime meshing software that handles stratified meshes. Visualizations of various examples from the software conclude the work, with examples of single manifold 2d x time, single manifold 3d x time, and a multiple manifold example in 2d x time.","abstract_html":"We introduce the spacetime discontinuous Galerkin method and motivate the need for supporting spacetime meshing on meshes comprised of multiple manifolds. We first discuss preliminary concepts behind simplices, simplicial complexes, and the generalization to oriented simplicies. Using these ideas, we define stratified spaces and how they can be used to model a mesh comprised of multiple oriented manifolds. We construct a graphical representation called a Stratified Mesh and use this representation to construct a collection of data structures, the main result being the StratifiedMesh data structure. Next we define a set of support algorithms based on the various data structures discussed. This leads us to review the fundamentals of the TentPitcher algorithm and its relationship to spacetime discontinuous Galerkin methods both theoretically and in the literature. The TentPitcher algorithm is then extended to work on stratified meshes in E^d x R for arbitrary spatial dimension d. We then briefly discuss a parametrization for tentpole vertices that generalizes the baseline TentPitcher, vertex smoothing, and tilted tentpoles. Following that, we discuss at a high level the generic software architecture and techniques used build completely new spacetime meshing software that handles stratified meshes. Visualizations of various examples from the software conclude the work, with examples of single manifold 2d x time, single manifold 3d x time, and a multiple manifold example in 2d x time.","abstract_has_math":false,"creators":["Howard, Christian Joseph"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Erickson, Jeff"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-08-23T20:05:21Z","date_published":"2019-08-23T20:05:21Z","updated_at":"2026-07-22T22:24:42Z","subjects":["computer science","graph","computational","geometry","computational geometry","topology","homology","simplex","simplices","complexes","simplicial homology","data structures","data structure","algorithm","algorithms","spacetime","space-time","finite element","galerkin","meshing","stratified spaces","discontinuous","cpp","C++","hyperbolic","partial differential equations","differential equations","numerical methods","generics","metaprogramming"],"languages":["en"],"rights":["Copyright 2019 Christian Joseph Howard"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/104936","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Erickson, Jeff"]},{"key":"dc:creator","label":"Author","values":["Howard, Christian Joseph"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-08-23T20:05:21Z","2019-04-25","2019-05"]},{"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":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"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","graph","computational","geometry","computational geometry","topology","homology","simplex","simplices","complexes","simplicial homology","data structures","data structure","algorithm","algorithms","spacetime","space-time","finite element","galerkin","meshing","stratified spaces","discontinuous","cpp","C++","hyperbolic","partial differential equations","differential equations","numerical methods","generics","metaprogramming"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2019 Christian Joseph Howard"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/104936"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We introduce the spacetime discontinuous Galerkin method and motivate the need for supporting spacetime meshing on meshes comprised of multiple manifolds. We first discuss preliminary concepts behind simplices, simplicial complexes, and the generalization to oriented simplicies. Using these ideas, we define stratified spaces and how they can be used to model a mesh comprised of multiple oriented manifolds. We construct a graphical representation called a Stratified Mesh and use this representation to construct a collection of data structures, the main result being the StratifiedMesh data structure. Next we define a set of support algorithms based on the various data structures discussed. This leads us to review the fundamentals of the TentPitcher algorithm and its relationship to spacetime discontinuous Galerkin methods both theoretically and in the literature. The TentPitcher algorithm is then extended to work on stratified meshes in E^d x R for arbitrary spatial dimension d. We then briefly discuss a parametrization for tentpole vertices that generalizes the baseline TentPitcher, vertex smoothing, and tilted tentpoles. Following that, we discuss at a high level the generic software architecture and techniques used build completely new spacetime meshing software that handles stratified meshes. Visualizations of various examples from the software conclude the work, with examples of single manifold 2d x time, single manifold 3d x time, and a multiple manifold example in 2d x time.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Christian Howard, accepted the attached license on 2019-04-25 at 11:23.","The student, Christian Howard, submitted this Thesis for approval on 2019-04-25 at 11:46.","This Thesis was approved for publication on 2019-04-25 at 13:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13909 on 2019-08-22 at 14:46:44","Made available in DSpace on 2019-08-23T20:05:21Z (GMT). No. of bitstreams: 26 HOWARD-THESIS-2019.pdf: 11351864 bytes, checksum: 817d25db653560532f261865b4f87aa1 (MD5) 3dxtime_smoothing.png: 268037 bytes, checksum: 24cf05abaa2b03fd0e26d4bd79d83f7d (MD5) IEEE_ECE.bst: 59476 bytes, checksum: 7668c5e97bcc2d22a9f8d4eab9b269ee (MD5) abs.tex: 1576 bytes, checksum: 98923739bcf1bc9e16de14d1eb14319b (MD5) ack.tex: 648 bytes, checksum: e617dde208410c41200c70c6e3bf128a (MD5) active_inactive_pitch_cells.png: 53104 bytes, checksum: 65a125b49d43de521cfa090533c80767 (MD5) cell_and_facets.png: 31698 bytes, checksum: 42a0100ef9bdaae27ac5190740a15b4a (MD5) crack_ex.png: 3710 bytes, checksum: 5363f82373b23c6defb2cae495f1898b (MD5) csthesis.tex: 3815 bytes, checksum: a9732a1684ea2186e9522751edf7043f (MD5) customizations.tex: 2518 bytes, checksum: 13b3d08f85de677078104c47642fadb5 (MD5) ds_and_algos.tex: 40551 bytes, checksum: b889a5c9f11101c3b2957c07787f9001 (MD5) ex_edge_classes.png: 46730 bytes, checksum: c8926bde645f683bab10ec0333eaecdb (MD5) ex_polytope.png: 23230 bytes, checksum: 06527587688d8005d52b71e06ff88437 (MD5) extended_fp.png: 75700 bytes, checksum: 7f15a20f7ee86fb5fabca3061a2d8f80 (MD5) interstitial_2dxtime.png: 3371708 bytes, checksum: 2505f389bfdc4d7d7e6f35a0da9f79f8 (MD5) intro.tex: 5138 bytes, checksum: ea20de7f6ffae324d67c8d4cd968ef98 (MD5) mathy.tex: 9869 bytes, checksum: fd6b56eeb86a316f078f8fa0bd9addb5 (MD5) oriented_simplices_ex.png: 27789 bytes, checksum: f578636047c76561b6c703608f670fec (MD5) packages.tex: 1178 bytes, checksum: 2ac6ae5a202533c7b73da657a1409465 (MD5) smoothed_3dxtime.png: 200661 bytes, checksum: 7f2334aa4d430b019bdc49e520ada72e (MD5) socket_pitching.jpg: 7257408 bytes, checksum: a034c1749913029c466bdc67c9aba3a7 (MD5) software.tex: 16807 bytes, checksum: 786e3d43787d376f5889cc34b52ddf81 (MD5) stratified_space.png: 90876 bytes, checksum: 6ba67b7a18d6afaffad52aff3ffe16d5 (MD5) thesisrefs.bib: 17926 bytes, checksum: a94790522235022f3d0f3351b2dfef12 (MD5) uiuc_csthesis18.cls: 20152 bytes, checksum: 4c3f14fbaedceeaf55a7699c7dce1be5 (MD5) LICENSE.txt: 4213 bytes, checksum: 162e97b46ce84b54bcc3211b6a39bcf2 (MD5) Previous issue date: 2019-04-25"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions"]}]}],"canonical_facts":{"dc:contributor":["Erickson, Jeff"],"dc:creator":["Howard, Christian Joseph"],"dc:date":["2019-08-23T20:05:21Z","2019-04-25","2019-05"],"dc:description":["We introduce the spacetime discontinuous Galerkin method and motivate the need for supporting spacetime meshing on meshes comprised of multiple manifolds. We first discuss preliminary concepts behind simplices, simplicial complexes, and the generalization to oriented simplicies. Using these ideas, we define stratified spaces and how they can be used to model a mesh comprised of multiple oriented manifolds. We construct a graphical representation called a Stratified Mesh and use this representation to construct a collection of data structures, the main result being the StratifiedMesh data structure. Next we define a set of support algorithms based on the various data structures discussed. This leads us to review the fundamentals of the TentPitcher algorithm and its relationship to spacetime discontinuous Galerkin methods both theoretically and in the literature. The TentPitcher algorithm is then extended to work on stratified meshes in E^d x R for arbitrary spatial dimension d. We then briefly discuss a parametrization for tentpole vertices that generalizes the baseline TentPitcher, vertex smoothing, and tilted tentpoles. Following that, we discuss at a high level the generic software architecture and techniques used build completely new spacetime meshing software that handles stratified meshes. Visualizations of various examples from the software conclude the work, with examples of single manifold 2d x time, single manifold 3d x time, and a multiple manifold example in 2d x time.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Christian Howard, accepted the attached license on 2019-04-25 at 11:23.","The student, Christian Howard, submitted this Thesis for approval on 2019-04-25 at 11:46.","This Thesis was approved for publication on 2019-04-25 at 13:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13909 on 2019-08-22 at 14:46:44","Made available in DSpace on 2019-08-23T20:05:21Z (GMT). No. of bitstreams: 26 HOWARD-THESIS-2019.pdf: 11351864 bytes, checksum: 817d25db653560532f261865b4f87aa1 (MD5) 3dxtime_smoothing.png: 268037 bytes, checksum: 24cf05abaa2b03fd0e26d4bd79d83f7d (MD5) IEEE_ECE.bst: 59476 bytes, checksum: 7668c5e97bcc2d22a9f8d4eab9b269ee (MD5) abs.tex: 1576 bytes, checksum: 98923739bcf1bc9e16de14d1eb14319b (MD5) ack.tex: 648 bytes, checksum: e617dde208410c41200c70c6e3bf128a (MD5) active_inactive_pitch_cells.png: 53104 bytes, checksum: 65a125b49d43de521cfa090533c80767 (MD5) cell_and_facets.png: 31698 bytes, checksum: 42a0100ef9bdaae27ac5190740a15b4a (MD5) crack_ex.png: 3710 bytes, checksum: 5363f82373b23c6defb2cae495f1898b (MD5) csthesis.tex: 3815 bytes, checksum: a9732a1684ea2186e9522751edf7043f (MD5) customizations.tex: 2518 bytes, checksum: 13b3d08f85de677078104c47642fadb5 (MD5) ds_and_algos.tex: 40551 bytes, checksum: b889a5c9f11101c3b2957c07787f9001 (MD5) ex_edge_classes.png: 46730 bytes, checksum: c8926bde645f683bab10ec0333eaecdb (MD5) ex_polytope.png: 23230 bytes, checksum: 06527587688d8005d52b71e06ff88437 (MD5) extended_fp.png: 75700 bytes, checksum: 7f15a20f7ee86fb5fabca3061a2d8f80 (MD5) interstitial_2dxtime.png: 3371708 bytes, checksum: 2505f389bfdc4d7d7e6f35a0da9f79f8 (MD5) intro.tex: 5138 bytes, checksum: ea20de7f6ffae324d67c8d4cd968ef98 (MD5) mathy.tex: 9869 bytes, checksum: fd6b56eeb86a316f078f8fa0bd9addb5 (MD5) oriented_simplices_ex.png: 27789 bytes, checksum: f578636047c76561b6c703608f670fec (MD5) packages.tex: 1178 bytes, checksum: 2ac6ae5a202533c7b73da657a1409465 (MD5) smoothed_3dxtime.png: 200661 bytes, checksum: 7f2334aa4d430b019bdc49e520ada72e (MD5) socket_pitching.jpg: 7257408 bytes, checksum: a034c1749913029c466bdc67c9aba3a7 (MD5) software.tex: 16807 bytes, checksum: 786e3d43787d376f5889cc34b52ddf81 (MD5) stratified_space.png: 90876 bytes, checksum: 6ba67b7a18d6afaffad52aff3ffe16d5 (MD5) thesisrefs.bib: 17926 bytes, checksum: a94790522235022f3d0f3351b2dfef12 (MD5) uiuc_csthesis18.cls: 20152 bytes, checksum: 4c3f14fbaedceeaf55a7699c7dce1be5 (MD5) LICENSE.txt: 4213 bytes, checksum: 162e97b46ce84b54bcc3211b6a39bcf2 (MD5) Previous issue date: 2019-04-25"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/104936"],"dc:language":["en"],"dc:rights":["Copyright 2019 Christian Joseph Howard"],"dc:subject":["computer science","graph","computational","geometry","computational geometry","topology","homology","simplex","simplices","complexes","simplicial homology","data structures","data structure","algorithm","algorithms","spacetime","space-time","finite element","galerkin","meshing","stratified spaces","discontinuous","cpp","C++","hyperbolic","partial differential equations","differential equations","numerical methods","generics","metaprogramming"],"dc:title":["Spacetime meshing of stratified spaces for spacetime discontinuous Galerkin methods in arbitrary spatial dimensions"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:42Z"}