Scott Canann | Brigham Young University (original) (raw)
Papers by Scott Canann
ASME APPLIED MECHANICS …, 1997
carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed... more carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed ZI, Scott A. Canann, and Sunil Saigal. AMD-Vol. 220 Trends in Unstructured Mesh Generation, ASME, pp.73-80, July 1997. MESHING RESEARCH CORNER. ...
ASME APPLIED MECHANICS …, 1997
carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed... more carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed ZI, Scott A. Canann, and Sunil Saigal. AMD-Vol. 220 Trends in Unstructured Mesh Generation, ASME, pp.73-80, July 1997. MESHING RESEARCH CORNER. ...
Advances in Engineering Software and Workstations, 1991
This paper describes the impact of paving, a new automatic mesh generation algorithm, on the anal... more This paper describes the impact of paving, a new automatic mesh generation algorithm, on the analysis portion of the design process. Paving generates an all-quadrilateral mesh in arbitrary 2D geometries. The paving technique significantly impacts the analysis process by drastically reducing the time and expertise requirements of traditional mesh generation. Paving produces a high quality mesh based on geometric boundary definitions and user specified clement sizing constraints. In this paper we describe the paving algorithm, discuss varying aspects of the impact of the technique on design automation, and elaborate on current research into 3D allhexahcdral mesh generation.
Engineering with Computers, 1998
Engineering with Computers, 1996
Engineering with Computers, 1999
BMSweep is a new algorithm to determine the location of interior nodes while volume sweeping. BMS... more BMSweep is a new algorithm to determine the location of interior nodes while volume sweeping. BMSweep uses background mesh interpolation to locate interior nodes while sweeping two and one half dimensional volumes. Three dimensional volumes can be swept using BMSweep after being decomposed into two and one half dimensional volumes. The interpolation method provides for quality element creation while allowing the volume boundary to vary.
A method is proposed whereby an existing non-conforming, mixed hexahedra-tetrahedra element mesh,... more A method is proposed whereby an existing non-conforming, mixed hexahedra-tetrahedra element mesh, is altered to conform by the insertion and formation of five-node or thirteen-node pyramids. Local tetrahedral transformations are performed to provide the topology enabling the merging of two adjacent tetrahedra into one pyramid. Local smoothing and cleanup operations improve the quality of the transition region. Other methods for the creation of transition pyramid elements are also discussed.
International Meshing Roundtable, 1998
Automatic finite element mesh generation of CAD generated data has been a goal of finite element ... more Automatic finite element mesh generation of CAD generated data has been a goal of finite element meshing codes for years. However, the lack of accuracy and the amount of detail in this data have made this a daunting task. In essence, the CAD data needs to be defeatured to overcome accuracy deficiencies and to remove excessive detail. In this pape
Quad-morphing is a new technique used for generating quadrilaterals from an existing triangle mes... more Quad-morphing is a new technique used for generating quadrilaterals from an existing triangle mesh. Beginning with an initial triangulation, triangles are systematically transformed and combined. An advancing front method is used to determine the order of transformations. An all-quadrilateral mesh containing elements aligned with the area boundaries with few irregular internal nodes can be generated.
A method for solving space-time problems involving three-dimensional space wherein an unstructure... more A method for solving space-time problems involving three-dimensional space wherein an unstructured four-dimensional finite element model is generated and solved to produce a four-dimensional solution. The four-dimensional mesh is generated from a three-dimensional mesh by extruding each of the simplices of the three-dimensional mesh in a time dimension. The four-dimensional prisms formed by extrusion of the three-dimensional simplices are divided into a plurality of four-dimensional simplices which form a four-dimensional finite element model. The elements of the four-dimensional model can be selectively refined to obtain a finer mesh in areas of greater interest, and a coarser mesh in areas which are of less interest. The mesh can be refined in the spatial dimensions and also in the temporal dimension.
. Automatic finite element mesh generation techniques have become commonly used tools for the ana... more . Automatic finite element mesh generation techniques have become commonly used tools for the analysis of complex, real-world models. All of these methods can, however, create distorted and even unusable elements. Fortunately, several techniques exist which can take an existing mesh and improve its quality. Smoothing (also referred to as mesh relaxation) is one such method, which repositions nodal locations, so as to minimize element distortion. In this paper, an overall mesh smoothing scheme is presented for meshes consisting of triangular, quadrilateral, or mixed triangular and quadrilateral elements. This paper describes an efficient and robust combination of constrained Laplacian smoothing together with an optimization-based smoothing algorithm. The smoothing algorithms have been implemented in ANSYS and performance times are presented along with several example models. Keywords. Smoothing, Laplacian smoothing, optimization-based smoothing, triangular, quadrilateral, quaddominan...
The numerical solution of problems in science and engineering via the finite element method requi... more The numerical solution of problems in science and engineering via the finite element method requires, as a first step, the discretization of a domain into a set of simply shaped elements. Determining the size of these elements along the domain, including the boundary, to form well-shaped elements is a difficult task. We present in this paper a simple technique, called smart sizing, which automatically computes high quality initial element sizing on curves for triangular, quadrilateral and tetrahedral elements. Curve divisions are computed based on curve and surface curvatures as well as feature proximity. In the three dimensional case, refinement of facets is performed as needed to create reasonably sized surface elements. Computing a boundary mesh appropriately is a key step to successfully determine the size and distribution of new elements towards the interior of the domain, especially for the advancing front and constrained Delaunay meshing techniques.
A method and system for generating an unstructured automatic mesh and executing computational alg... more A method and system for generating an unstructured automatic mesh and executing computational algorithms using a finite element numerical approach is disclosed. The method is to model a hydrocarbon reservoir, wells, and completions as a single system, accounting for static information and transient behavior of wells, hydraulic fractures and reservoirs in a single model.
Schneiders and Debye (1995) present two algorithms for quadrilateral mesh refinement. These algor... more Schneiders and Debye (1995) present two algorithms for quadrilateral mesh refinement. These algorithms refine quadrilateral meshes while maintaining mesh conformity. The first algorithm maintains conformity by introducing triangles. The second algorithm maintains conformity without triangles, but requires a larger degree of refinement. Both algorithms introduce nodes with non-optimal valences. Non-optimal valences create acute and obtuse angles, decreasing element quality. This paper presents techniques for improving the quality of quadrilateral meshes after Schneiders' refinement. Improvement techniques use topology and node valence optimization rather than shape metrics; hence, improvement is computationally inexpensive. Meshes refined and subsequently topologically improved contain no triangles, even though triangles are initially introduced by Schneiders' refinement. Triangle elimination is especially important for linear elements since linear triangles perform poorly. I...
1 ABSTRACT The numerical solution of problems in science and engineering via the finite e lement ... more 1 ABSTRACT The numerical solution of problems in science and engineering via the finite e lement method requires, as a first step, the discretization of a domain into a set of simply shaped elements. Determining the size of these e lements along the domain, including the boundary, to form well-shaped elements is a difficult task. We present in this paper
International Meshing Roundtable, 1998
A method is presented for meshing 3D CAD surfaces in parametric space using an advancing front ap... more A method is presented for meshing 3D CAD surfaces in parametric space using an advancing front approach and a metric map to govern the size and shape of the triangles in the parametric space. The creation of the metric map will be discussed. The advanc ing front mesher generates triangles based on the metric map, stretching them in order to
Engineering With Computers, 2001
... Mid-Node Admissible Space for 3D Quadratic Tetrahedral Finite Elements AZI Salem, S. Saigal a... more ... Mid-Node Admissible Space for 3D Quadratic Tetrahedral Finite Elements AZI Salem, S. Saigal and SA Canann ... Babuska and Aziz [3] proposed the maximum angle con-dition, and also showed that the minimum angle condition [4–6] is not essential. ...
International Journal for Numerical Methods in Engineering, 2001
Page 1. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 200... more Page 1. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2001; 50:181197 Mid-node admissible spaces for quadratic triangular 2D finite elements with one edge curved ...
ASME APPLIED MECHANICS …, 1997
carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed... more carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed ZI, Scott A. Canann, and Sunil Saigal. AMD-Vol. 220 Trends in Unstructured Mesh Generation, ASME, pp.73-80, July 1997. MESHING RESEARCH CORNER. ...
ASME APPLIED MECHANICS …, 1997
carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed... more carrier image, Robust Distortion Metric for Quadratic Triangular 2D Finite Elements. Salem, Ahmed ZI, Scott A. Canann, and Sunil Saigal. AMD-Vol. 220 Trends in Unstructured Mesh Generation, ASME, pp.73-80, July 1997. MESHING RESEARCH CORNER. ...
Advances in Engineering Software and Workstations, 1991
This paper describes the impact of paving, a new automatic mesh generation algorithm, on the anal... more This paper describes the impact of paving, a new automatic mesh generation algorithm, on the analysis portion of the design process. Paving generates an all-quadrilateral mesh in arbitrary 2D geometries. The paving technique significantly impacts the analysis process by drastically reducing the time and expertise requirements of traditional mesh generation. Paving produces a high quality mesh based on geometric boundary definitions and user specified clement sizing constraints. In this paper we describe the paving algorithm, discuss varying aspects of the impact of the technique on design automation, and elaborate on current research into 3D allhexahcdral mesh generation.
Engineering with Computers, 1998
Engineering with Computers, 1996
Engineering with Computers, 1999
BMSweep is a new algorithm to determine the location of interior nodes while volume sweeping. BMS... more BMSweep is a new algorithm to determine the location of interior nodes while volume sweeping. BMSweep uses background mesh interpolation to locate interior nodes while sweeping two and one half dimensional volumes. Three dimensional volumes can be swept using BMSweep after being decomposed into two and one half dimensional volumes. The interpolation method provides for quality element creation while allowing the volume boundary to vary.
A method is proposed whereby an existing non-conforming, mixed hexahedra-tetrahedra element mesh,... more A method is proposed whereby an existing non-conforming, mixed hexahedra-tetrahedra element mesh, is altered to conform by the insertion and formation of five-node or thirteen-node pyramids. Local tetrahedral transformations are performed to provide the topology enabling the merging of two adjacent tetrahedra into one pyramid. Local smoothing and cleanup operations improve the quality of the transition region. Other methods for the creation of transition pyramid elements are also discussed.
International Meshing Roundtable, 1998
Automatic finite element mesh generation of CAD generated data has been a goal of finite element ... more Automatic finite element mesh generation of CAD generated data has been a goal of finite element meshing codes for years. However, the lack of accuracy and the amount of detail in this data have made this a daunting task. In essence, the CAD data needs to be defeatured to overcome accuracy deficiencies and to remove excessive detail. In this pape
Quad-morphing is a new technique used for generating quadrilaterals from an existing triangle mes... more Quad-morphing is a new technique used for generating quadrilaterals from an existing triangle mesh. Beginning with an initial triangulation, triangles are systematically transformed and combined. An advancing front method is used to determine the order of transformations. An all-quadrilateral mesh containing elements aligned with the area boundaries with few irregular internal nodes can be generated.
A method for solving space-time problems involving three-dimensional space wherein an unstructure... more A method for solving space-time problems involving three-dimensional space wherein an unstructured four-dimensional finite element model is generated and solved to produce a four-dimensional solution. The four-dimensional mesh is generated from a three-dimensional mesh by extruding each of the simplices of the three-dimensional mesh in a time dimension. The four-dimensional prisms formed by extrusion of the three-dimensional simplices are divided into a plurality of four-dimensional simplices which form a four-dimensional finite element model. The elements of the four-dimensional model can be selectively refined to obtain a finer mesh in areas of greater interest, and a coarser mesh in areas which are of less interest. The mesh can be refined in the spatial dimensions and also in the temporal dimension.
. Automatic finite element mesh generation techniques have become commonly used tools for the ana... more . Automatic finite element mesh generation techniques have become commonly used tools for the analysis of complex, real-world models. All of these methods can, however, create distorted and even unusable elements. Fortunately, several techniques exist which can take an existing mesh and improve its quality. Smoothing (also referred to as mesh relaxation) is one such method, which repositions nodal locations, so as to minimize element distortion. In this paper, an overall mesh smoothing scheme is presented for meshes consisting of triangular, quadrilateral, or mixed triangular and quadrilateral elements. This paper describes an efficient and robust combination of constrained Laplacian smoothing together with an optimization-based smoothing algorithm. The smoothing algorithms have been implemented in ANSYS and performance times are presented along with several example models. Keywords. Smoothing, Laplacian smoothing, optimization-based smoothing, triangular, quadrilateral, quaddominan...
The numerical solution of problems in science and engineering via the finite element method requi... more The numerical solution of problems in science and engineering via the finite element method requires, as a first step, the discretization of a domain into a set of simply shaped elements. Determining the size of these elements along the domain, including the boundary, to form well-shaped elements is a difficult task. We present in this paper a simple technique, called smart sizing, which automatically computes high quality initial element sizing on curves for triangular, quadrilateral and tetrahedral elements. Curve divisions are computed based on curve and surface curvatures as well as feature proximity. In the three dimensional case, refinement of facets is performed as needed to create reasonably sized surface elements. Computing a boundary mesh appropriately is a key step to successfully determine the size and distribution of new elements towards the interior of the domain, especially for the advancing front and constrained Delaunay meshing techniques.
A method and system for generating an unstructured automatic mesh and executing computational alg... more A method and system for generating an unstructured automatic mesh and executing computational algorithms using a finite element numerical approach is disclosed. The method is to model a hydrocarbon reservoir, wells, and completions as a single system, accounting for static information and transient behavior of wells, hydraulic fractures and reservoirs in a single model.
Schneiders and Debye (1995) present two algorithms for quadrilateral mesh refinement. These algor... more Schneiders and Debye (1995) present two algorithms for quadrilateral mesh refinement. These algorithms refine quadrilateral meshes while maintaining mesh conformity. The first algorithm maintains conformity by introducing triangles. The second algorithm maintains conformity without triangles, but requires a larger degree of refinement. Both algorithms introduce nodes with non-optimal valences. Non-optimal valences create acute and obtuse angles, decreasing element quality. This paper presents techniques for improving the quality of quadrilateral meshes after Schneiders' refinement. Improvement techniques use topology and node valence optimization rather than shape metrics; hence, improvement is computationally inexpensive. Meshes refined and subsequently topologically improved contain no triangles, even though triangles are initially introduced by Schneiders' refinement. Triangle elimination is especially important for linear elements since linear triangles perform poorly. I...
1 ABSTRACT The numerical solution of problems in science and engineering via the finite e lement ... more 1 ABSTRACT The numerical solution of problems in science and engineering via the finite e lement method requires, as a first step, the discretization of a domain into a set of simply shaped elements. Determining the size of these e lements along the domain, including the boundary, to form well-shaped elements is a difficult task. We present in this paper
International Meshing Roundtable, 1998
A method is presented for meshing 3D CAD surfaces in parametric space using an advancing front ap... more A method is presented for meshing 3D CAD surfaces in parametric space using an advancing front approach and a metric map to govern the size and shape of the triangles in the parametric space. The creation of the metric map will be discussed. The advanc ing front mesher generates triangles based on the metric map, stretching them in order to
Engineering With Computers, 2001
... Mid-Node Admissible Space for 3D Quadratic Tetrahedral Finite Elements AZI Salem, S. Saigal a... more ... Mid-Node Admissible Space for 3D Quadratic Tetrahedral Finite Elements AZI Salem, S. Saigal and SA Canann ... Babuska and Aziz [3] proposed the maximum angle con-dition, and also showed that the minimum angle condition [4–6] is not essential. ...
International Journal for Numerical Methods in Engineering, 2001
Page 1. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 200... more Page 1. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2001; 50:181197 Mid-node admissible spaces for quadratic triangular 2D finite elements with one edge curved ...