#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1970

2017

- This year (1)
- Last 5 years (22)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kevin J. Barker, Andrey N. Chernikov, Nikos Chrisochoides, Keshav Pingali
- IEEE Transactions on Parallel and Distributed…
- 2004

We describe the design of a flexible load balancing framework and runtime software system for supporting the development of adaptive applications on distributed-memory parallel computers. The runtime system supports a global namespace, transparent object migration, automatic message forwarding and routing, and automatic load balancing. These features can be… (More)

The contribution of the current paper is three-fold. First, we generalize the existing sequential point placement strategies for guaranteed quality Delaunay refinement: instead of a specific position for a new point, we derive a selection disk inside the circumdisk of a poor quality triangle. We prove that any point placement algorithm that inserts a point… (More)

We describe a parallel scheduler, for guaranteed quality parallel mesh generation and refinement methods. We prove a sufficient condition for the new points to be independent, which permits the concurrent insertion of more than two points without destroying the conformity and Delaunay properties of the mesh. The scheduling technique we present is much more… (More)

Delaunay refinement is a widely used method for the construction of guaranteed quality triangular and tetrahedral meshes. We present the algorithm and the software for the parallel constrained Delaunay mesh generation. Our approach is based on the decomposition of the original mesh generation problem into N smaller subproblems which are meshed in parallel.… (More)

Given the importance of parallel mesh generation in large-scale scientific applications and the proliferation of multilevel SMT-based architectures, it is imperative to obtain insight on the interaction between meshing algorithms and these systems. We focus on Parallel Constrained Delaunay Mesh (PCDM) generation. We exploit coarse-grain parallelism at the… (More)

- Andrey N. Chernikov, Nikos Chrisochoides
- SIAM J. Scientific Computing
- 2006

We present a theoretical framework for developing parallel guaranteed quality Delaunay mesh generation software, that allows us to use commercial off-the-shelf sequential Delaunay meshers for two-dimensional geometries. In this paper, we describe our approach for constructing uniform meshes, in other words, the meshes in which all elements have… (More)

- Andrey N. Chernikov, Nikos Chrisochoides
- SIAM J. Scientific Computing
- 2011

We present a novel algorithm for tetrahedral image-to-mesh conversion which allows for guaranteed bounds on the smallest dihedral angle and on the distance between the boundaries of the mesh and the boundaries of the tissues. The algorithm produces a small number of mesh elements that comply with these bounds. We also describe and evaluate our… (More)

- Yasushi Ito, Alan M. Shih, +4 authors Kazuhiro Nakahashi
- Mathematics and Computers in Simulation
- 2007

Mesh generation is a critical step in high fidelity computational simulations. High quality and high density meshes are required to accurately capture the complex physical phenomena. A parallel framework has been developed to generate large-scale meshes in a short period of time. A coarse volume mesh is generated first to provide the basis of block… (More)

- Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos Chrisochoides
- SIAM J. Scientific Computing
- 2010

We develop the first ever fully functional three-dimensional guaranteed quality parallel graded Delaunay mesh generator. First, we prove a criterion and a sufficient condition of Delaunay-independence of Steiner points in three dimensions. Based on these results, we decompose the iteration space of the sequential Delaunay refinement algorithm by selecting… (More)