Search
Search Results
-
Segmentation of Abdominal Computed Tomography Scans Using Analysis of Texture Features and Its Application to Personalized Forward Electrocardiography Modeling
Electrical activity of the heart muscles can be measured noninvasively on the body surface using electrocardiography (ECG) method. Numerical results...
-
Terminal Star Operations Algorithm for Tetrahedral Mesh Improvement
We discuss an innovative, simple and effective Lepp terminal-star algorithm for improving tetrahedral meshes. For each bad quality tetrahedron, one...
-
Full Groups
The notion of full group was introduced in 1959 by H. Dye in his study of orbit equivalence of measured dynamical systems [19] and [20]. In the first...
-
On Synge-type angle condition for d-simplices
The maximum angle condition of J. L. Synge was originally introduced in interpolation theory and further used in finite element analysis and...
-
Boundary conforming Delaunay mesh generation
A boundary conforming Delaunay mesh is a partitioning of a polyhedral domain into Delaunay simplices such that all boundary simplices satisfy the gener...
-
Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes
It is a well-established fact that the witness complex is closely related to the restricted Delaunay triangulation in low dimensions. Specifically,...
-
Orbit equivalence for Cantor minimal ℤ d -systems
We show that every minimal action of any finitely generated abelian group on the Cantor set is (topologically) orbit equivalent to an AF relation. As...
-
-
Composite finite elements for 3D image based computing
We present an algorithmical concept for modeling and simulation with partial differential equations (PDEs) in image based computing where the...
-
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they...
-
Unflippable Tetrahedral Complexes
We present a 16-vertex tetrahedralization of S 3 (the 3-sphere) for which no topological bistellar flip other than a 1-to-4 flip (i.e., a...
-
Dense Point Sets Have Sparse Delaunay Triangulations or “... But Not Too Nasty”
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of...
-
Adaptive Mesh Generation
These notes cover topics in mesh generation from a computational geometry perspective. This perspective means emphasis on difficiult domain geometry,...
-
Nice Point Sets Can Have Nasty Delaunay Triangulations
Abstract. We consider the complexity of Delaunay triangulations of sets of points in R 3 under certain practical geometric constraints. The spread ...
-
Generating Well-Shaped d-dimensional Delaunay Meshes
A d-dimensional simplicial mesh is a Delaunay triangulation if the circumsphere of each of its simplices does not contain any vertices inside. A mesh...