Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ungor, Alper"'
Autor:
Har-Peled, Sariel, Ungor, Alper
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 output size. This is the first time-optimal
Externí odkaz:
http://arxiv.org/abs/cs/0501007
Autor:
Edelsbrunner, Herbert, Ungor, Alper
We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in $\Rspace^3$.
Comment: 17 pages; 7 figures; 3 tables; see also http://www.cs.duke.edu/~ungor/abstracts/schedul
Comment: 17 pages; 7 figures; 3 tables; see also http://www.cs.duke.edu/~ungor/abstracts/schedul
Externí odkaz:
http://arxiv.org/abs/cs/0302031
Publikováno v:
Computational Geometry Theory & Applications 27(3):237-255, 2004
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 are less than $77.08^\circ$, and another which tiles
Externí odkaz:
http://arxiv.org/abs/cs/0302027
In this paper, we analyze the complexity of natural parallelizations of Delaunay refinement methods for mesh generation. The parallelizations employ a simple strategy: at each iteration, they choose a set of ``independent'' points to insert into the
Externí odkaz:
http://arxiv.org/abs/cs/0207063