In this paper, we analyze the omplexity of natural parallelizations of Delaunay re nement methods for mesh generation. The parallelizations employ a simple strategy: at ea h iteration, they hoose a… (More)

We introduce a new type of Steiner points, called off-centers, as an alternative to circumcenters, to improve the quality of Delaunay triangulations. We propose a new Delaunay refinement algorithm… (More)

We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which all dihedral angles… (More)

We present an algorithm to construct meshes suitable for spacetime discontinuous Galerkin finite-element methods. Our method generalizes and improves the ‘Tent Pitcher’ algorithm of Üngör and… (More)

We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a triangulation of the… (More)

We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes O(n log n + m) time, where n is the input size and m is the… (More)

We consider a short-term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is… (More)

We show that it is possible to tile the three dimensional space using only acute dihedral angle tetra-hedra. Several constructions to achieve this objective are presented. Largest dihedral angle in… (More)