We propose an algorithm to compute a conforming Delaunay mesh of a polyhedral domain in three dimensions. Arbitrarily small input angles are allowed. The output mesh is graded and...
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
We propose a new two-dimensional meshing algorithm called PINW able to generate meshes that accurately approximate the distance between any two domain points by paths composed onl...
Pritam Ganguly, Stephen A. Vavasis, Katerina D. Pa...
This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast s...
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...