Tetrahedral meshes from planar cross-sections

In biomedicine, many three-dimensional (3D) objects are sampled in terms of slices such as computed tomography (CT), magnetic resonance imaging (MRI), and ultrasound imaging. It is often necessary to construct surface meshes from the cross sections for visualization, and thereafter construct tetrahe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer methods in applied mechanics and engineering 1999-08, Vol.179 (1), p.31-52
Hauptverfasser: Bajaj, Chandrajit L., Coyle, Edward J., Lin, Kwun-Nan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 52
container_issue 1
container_start_page 31
container_title Computer methods in applied mechanics and engineering
container_volume 179
creator Bajaj, Chandrajit L.
Coyle, Edward J.
Lin, Kwun-Nan
description In biomedicine, many three-dimensional (3D) objects are sampled in terms of slices such as computed tomography (CT), magnetic resonance imaging (MRI), and ultrasound imaging. It is often necessary to construct surface meshes from the cross sections for visualization, and thereafter construct tetrahedra for the solid bounded by the surface meshes for the purpose of finite element analysis. In Ref. [1] (C. Bajaj, E. Coyle and K. Lin, Graphical Models and Image Processing 58 (6) (1996) 524–543), we provided a solution to the construction of a surface triangular mesh from planar -section contours. Here we provide an approach to tetrahedralize the solid region bounded by planar contours and the surface mesh. It is a difficult task because the solid can be of high genus (several through holes) as well as have complicated branching regions. We develop an algorithm to effectively reduce the solid into prismatoids, and provide an approach to tetrahedralize the prismatoids. Our tetrahedralization approach is similar to the advancing front technique (AFT) for its flexible control of mesh quality. The main criticism of AFT is that the remaining interior may be badly shaped or even untetrahedralizable. The emphasis of our prismatoid tetrahedralization approach is on the characterization and prevention of untetrahedralizable parts. Ruppert and Seidel (J. Ruppert, R. Seidel, On the difficulty of tetrahedralizing three-dimensional non-convex polyhedra, in: Proceedings 5th Annual ACM Symposium Comput. Geom., 1989, p. 380–392) have shown that the problem of deciding whether a polyhedron is tetrahedralizable without adding Steiner points is NP-complete. We characterize this problem under certain constraints, and design one rule to reduce the chance of generating untetrahedralizable shapes. The characterization also leads to the classification of two common untetrahedralizable categories which can be better processed if they do occur.
doi_str_mv 10.1016/S0045-7825(99)00030-4
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_23275342</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0045782599000304</els_id><sourcerecordid>527986</sourcerecordid><originalsourceid>FETCH-LOGICAL-c398t-5cb090bc88e98d5bf6a5e00b54a476192f07b5a05ffbf3352b7f0eaac4968d0b3</originalsourceid><addsrcrecordid>eNqFkE1LxDAQhoMouK7-BKEHET1UJ03TJCeRxS9Y8OB6Dkk6YSPddk26gv_edlf0uKe5PDPvOw8h5xRuKNDq9g2g5LmQBb9S6hoAGOTlAZlQKVReUCYPyeQPOSYnKX0MEEhaTEi-wD6aJdbRNNkK0xJT5mO3ytaNaU3MXOxSyhO6PnRtOiVH3jQJz37nlLw_Pixmz_n89elldj_PHVOyz7mzoMA6KVHJmltfGY4AlpemFBVVhQdhuQHuvfWM8cIKD2iMK1Ula7BsSi53d9ex-9xg6vUqJIfN0Am7TdIFKwRnZbEfpGVVCVYOIN-B24cier2OYWXit6agR4t6a1GPirRSemtRj3sXvwEmOdP4aFoX0v-yYgL42ONuh-Fg5Stg1MkFbB3WIQ7udN2FPUE_EMKFeQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>21466734</pqid></control><display><type>article</type><title>Tetrahedral meshes from planar cross-sections</title><source>Elsevier ScienceDirect Journals</source><creator>Bajaj, Chandrajit L. ; Coyle, Edward J. ; Lin, Kwun-Nan</creator><creatorcontrib>Bajaj, Chandrajit L. ; Coyle, Edward J. ; Lin, Kwun-Nan</creatorcontrib><description>In biomedicine, many three-dimensional (3D) objects are sampled in terms of slices such as computed tomography (CT), magnetic resonance imaging (MRI), and ultrasound imaging. It is often necessary to construct surface meshes from the cross sections for visualization, and thereafter construct tetrahedra for the solid bounded by the surface meshes for the purpose of finite element analysis. In Ref. [1] (C. Bajaj, E. Coyle and K. Lin, Graphical Models and Image Processing 58 (6) (1996) 524–543), we provided a solution to the construction of a surface triangular mesh from planar -section contours. Here we provide an approach to tetrahedralize the solid region bounded by planar contours and the surface mesh. It is a difficult task because the solid can be of high genus (several through holes) as well as have complicated branching regions. We develop an algorithm to effectively reduce the solid into prismatoids, and provide an approach to tetrahedralize the prismatoids. Our tetrahedralization approach is similar to the advancing front technique (AFT) for its flexible control of mesh quality. The main criticism of AFT is that the remaining interior may be badly shaped or even untetrahedralizable. The emphasis of our prismatoid tetrahedralization approach is on the characterization and prevention of untetrahedralizable parts. Ruppert and Seidel (J. Ruppert, R. Seidel, On the difficulty of tetrahedralizing three-dimensional non-convex polyhedra, in: Proceedings 5th Annual ACM Symposium Comput. Geom., 1989, p. 380–392) have shown that the problem of deciding whether a polyhedron is tetrahedralizable without adding Steiner points is NP-complete. We characterize this problem under certain constraints, and design one rule to reduce the chance of generating untetrahedralizable shapes. The characterization also leads to the classification of two common untetrahedralizable categories which can be better processed if they do occur.</description><identifier>ISSN: 0045-7825</identifier><identifier>EISSN: 1879-2138</identifier><identifier>DOI: 10.1016/S0045-7825(99)00030-4</identifier><identifier>CODEN: CMMECC</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Biological and medical sciences ; Biomechanics. Biorheology ; Computational geometry ; Computational techniques ; Computer aided design ; Computer science; control theory; systems ; Computer simulation ; Computerized tomography ; Exact sciences and technology ; Finite-element and galerkin methods ; Fundamental and applied biological sciences. Psychology ; Image processing ; Information, signal and communications theory ; Magnetic resonance imaging ; Mathematical methods in physics ; Medical imaging ; Physics ; Signal processing ; Software ; Telecommunications and information theory ; Three dimensional computer graphics ; Tissues, organs and organisms biophysics ; Ultrasonic imaging</subject><ispartof>Computer methods in applied mechanics and engineering, 1999-08, Vol.179 (1), p.31-52</ispartof><rights>1999 Elsevier Science S.A.</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c398t-5cb090bc88e98d5bf6a5e00b54a476192f07b5a05ffbf3352b7f0eaac4968d0b3</citedby><cites>FETCH-LOGICAL-c398t-5cb090bc88e98d5bf6a5e00b54a476192f07b5a05ffbf3352b7f0eaac4968d0b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0045782599000304$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65534</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1937052$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bajaj, Chandrajit L.</creatorcontrib><creatorcontrib>Coyle, Edward J.</creatorcontrib><creatorcontrib>Lin, Kwun-Nan</creatorcontrib><title>Tetrahedral meshes from planar cross-sections</title><title>Computer methods in applied mechanics and engineering</title><description>In biomedicine, many three-dimensional (3D) objects are sampled in terms of slices such as computed tomography (CT), magnetic resonance imaging (MRI), and ultrasound imaging. It is often necessary to construct surface meshes from the cross sections for visualization, and thereafter construct tetrahedra for the solid bounded by the surface meshes for the purpose of finite element analysis. In Ref. [1] (C. Bajaj, E. Coyle and K. Lin, Graphical Models and Image Processing 58 (6) (1996) 524–543), we provided a solution to the construction of a surface triangular mesh from planar -section contours. Here we provide an approach to tetrahedralize the solid region bounded by planar contours and the surface mesh. It is a difficult task because the solid can be of high genus (several through holes) as well as have complicated branching regions. We develop an algorithm to effectively reduce the solid into prismatoids, and provide an approach to tetrahedralize the prismatoids. Our tetrahedralization approach is similar to the advancing front technique (AFT) for its flexible control of mesh quality. The main criticism of AFT is that the remaining interior may be badly shaped or even untetrahedralizable. The emphasis of our prismatoid tetrahedralization approach is on the characterization and prevention of untetrahedralizable parts. Ruppert and Seidel (J. Ruppert, R. Seidel, On the difficulty of tetrahedralizing three-dimensional non-convex polyhedra, in: Proceedings 5th Annual ACM Symposium Comput. Geom., 1989, p. 380–392) have shown that the problem of deciding whether a polyhedron is tetrahedralizable without adding Steiner points is NP-complete. We characterize this problem under certain constraints, and design one rule to reduce the chance of generating untetrahedralizable shapes. The characterization also leads to the classification of two common untetrahedralizable categories which can be better processed if they do occur.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Biological and medical sciences</subject><subject>Biomechanics. Biorheology</subject><subject>Computational geometry</subject><subject>Computational techniques</subject><subject>Computer aided design</subject><subject>Computer science; control theory; systems</subject><subject>Computer simulation</subject><subject>Computerized tomography</subject><subject>Exact sciences and technology</subject><subject>Finite-element and galerkin methods</subject><subject>Fundamental and applied biological sciences. Psychology</subject><subject>Image processing</subject><subject>Information, signal and communications theory</subject><subject>Magnetic resonance imaging</subject><subject>Mathematical methods in physics</subject><subject>Medical imaging</subject><subject>Physics</subject><subject>Signal processing</subject><subject>Software</subject><subject>Telecommunications and information theory</subject><subject>Three dimensional computer graphics</subject><subject>Tissues, organs and organisms biophysics</subject><subject>Ultrasonic imaging</subject><issn>0045-7825</issn><issn>1879-2138</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNqFkE1LxDAQhoMouK7-BKEHET1UJ03TJCeRxS9Y8OB6Dkk6YSPddk26gv_edlf0uKe5PDPvOw8h5xRuKNDq9g2g5LmQBb9S6hoAGOTlAZlQKVReUCYPyeQPOSYnKX0MEEhaTEi-wD6aJdbRNNkK0xJT5mO3ytaNaU3MXOxSyhO6PnRtOiVH3jQJz37nlLw_Pixmz_n89elldj_PHVOyz7mzoMA6KVHJmltfGY4AlpemFBVVhQdhuQHuvfWM8cIKD2iMK1Ula7BsSi53d9ex-9xg6vUqJIfN0Am7TdIFKwRnZbEfpGVVCVYOIN-B24cier2OYWXit6agR4t6a1GPirRSemtRj3sXvwEmOdP4aFoX0v-yYgL42ONuh-Fg5Stg1MkFbB3WIQ7udN2FPUE_EMKFeQ</recordid><startdate>19990801</startdate><enddate>19990801</enddate><creator>Bajaj, Chandrajit L.</creator><creator>Coyle, Edward J.</creator><creator>Lin, Kwun-Nan</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19990801</creationdate><title>Tetrahedral meshes from planar cross-sections</title><author>Bajaj, Chandrajit L. ; Coyle, Edward J. ; Lin, Kwun-Nan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c398t-5cb090bc88e98d5bf6a5e00b54a476192f07b5a05ffbf3352b7f0eaac4968d0b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Biological and medical sciences</topic><topic>Biomechanics. Biorheology</topic><topic>Computational geometry</topic><topic>Computational techniques</topic><topic>Computer aided design</topic><topic>Computer science; control theory; systems</topic><topic>Computer simulation</topic><topic>Computerized tomography</topic><topic>Exact sciences and technology</topic><topic>Finite-element and galerkin methods</topic><topic>Fundamental and applied biological sciences. Psychology</topic><topic>Image processing</topic><topic>Information, signal and communications theory</topic><topic>Magnetic resonance imaging</topic><topic>Mathematical methods in physics</topic><topic>Medical imaging</topic><topic>Physics</topic><topic>Signal processing</topic><topic>Software</topic><topic>Telecommunications and information theory</topic><topic>Three dimensional computer graphics</topic><topic>Tissues, organs and organisms biophysics</topic><topic>Ultrasonic imaging</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bajaj, Chandrajit L.</creatorcontrib><creatorcontrib>Coyle, Edward J.</creatorcontrib><creatorcontrib>Lin, Kwun-Nan</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Computer methods in applied mechanics and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bajaj, Chandrajit L.</au><au>Coyle, Edward J.</au><au>Lin, Kwun-Nan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Tetrahedral meshes from planar cross-sections</atitle><jtitle>Computer methods in applied mechanics and engineering</jtitle><date>1999-08-01</date><risdate>1999</risdate><volume>179</volume><issue>1</issue><spage>31</spage><epage>52</epage><pages>31-52</pages><issn>0045-7825</issn><eissn>1879-2138</eissn><coden>CMMECC</coden><abstract>In biomedicine, many three-dimensional (3D) objects are sampled in terms of slices such as computed tomography (CT), magnetic resonance imaging (MRI), and ultrasound imaging. It is often necessary to construct surface meshes from the cross sections for visualization, and thereafter construct tetrahedra for the solid bounded by the surface meshes for the purpose of finite element analysis. In Ref. [1] (C. Bajaj, E. Coyle and K. Lin, Graphical Models and Image Processing 58 (6) (1996) 524–543), we provided a solution to the construction of a surface triangular mesh from planar -section contours. Here we provide an approach to tetrahedralize the solid region bounded by planar contours and the surface mesh. It is a difficult task because the solid can be of high genus (several through holes) as well as have complicated branching regions. We develop an algorithm to effectively reduce the solid into prismatoids, and provide an approach to tetrahedralize the prismatoids. Our tetrahedralization approach is similar to the advancing front technique (AFT) for its flexible control of mesh quality. The main criticism of AFT is that the remaining interior may be badly shaped or even untetrahedralizable. The emphasis of our prismatoid tetrahedralization approach is on the characterization and prevention of untetrahedralizable parts. Ruppert and Seidel (J. Ruppert, R. Seidel, On the difficulty of tetrahedralizing three-dimensional non-convex polyhedra, in: Proceedings 5th Annual ACM Symposium Comput. Geom., 1989, p. 380–392) have shown that the problem of deciding whether a polyhedron is tetrahedralizable without adding Steiner points is NP-complete. We characterize this problem under certain constraints, and design one rule to reduce the chance of generating untetrahedralizable shapes. The characterization also leads to the classification of two common untetrahedralizable categories which can be better processed if they do occur.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0045-7825(99)00030-4</doi><tpages>22</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0045-7825
ispartof Computer methods in applied mechanics and engineering, 1999-08, Vol.179 (1), p.31-52
issn 0045-7825
1879-2138
language eng
recordid cdi_proquest_miscellaneous_23275342
source Elsevier ScienceDirect Journals
subjects Algorithms
Applied sciences
Biological and medical sciences
Biomechanics. Biorheology
Computational geometry
Computational techniques
Computer aided design
Computer science
control theory
systems
Computer simulation
Computerized tomography
Exact sciences and technology
Finite-element and galerkin methods
Fundamental and applied biological sciences. Psychology
Image processing
Information, signal and communications theory
Magnetic resonance imaging
Mathematical methods in physics
Medical imaging
Physics
Signal processing
Software
Telecommunications and information theory
Three dimensional computer graphics
Tissues, organs and organisms biophysics
Ultrasonic imaging
title Tetrahedral meshes from planar cross-sections
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T11%3A46%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Tetrahedral%20meshes%20from%20planar%20cross-sections&rft.jtitle=Computer%20methods%20in%20applied%20mechanics%20and%20engineering&rft.au=Bajaj,%20Chandrajit%20L.&rft.date=1999-08-01&rft.volume=179&rft.issue=1&rft.spage=31&rft.epage=52&rft.pages=31-52&rft.issn=0045-7825&rft.eissn=1879-2138&rft.coden=CMMECC&rft_id=info:doi/10.1016/S0045-7825(99)00030-4&rft_dat=%3Cproquest_cross%3E527986%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=21466734&rft_id=info:pmid/&rft_els_id=S0045782599000304&rfr_iscdi=true