Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Türkoǧlu, Duru"'
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and lower bou
Externí odkaz:
http://arxiv.org/abs/1711.00068
Autor:
Türkoğlu, Duru, Turk, Ata
The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number is computationally expensive. Hence, a number of approximation algorith
Externí odkaz:
http://arxiv.org/abs/1710.09961
Let ${\cal P}$ be a set of $n$ points embedded in the plane, and let ${\cal C}$ be the complete Euclidean graph whose point-set is ${\cal P}$. Each edge in ${\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is assigned a
Externí odkaz:
http://arxiv.org/abs/1603.03818
Publikováno v:
In Computational Geometry: Theory and Applications August 2013 46(6):756-773
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.