Zobrazeno 1 - 10
of 1 166
pro vyhledávání: '"Polygon triangulation"'
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2018 Oct 01. 12(2), 439-454.
Externí odkaz:
https://www.jstor.org/stable/26511386
Autor:
Eppstein, David, Frishberg, Daniel
We prove that the well-studied triangulation flip walk on a convex point set mixes in time O(n^3 log^3 n), the first progress since McShine and Tetali's O(n^5 log n) bound in 1997. In the process we give lower and upper bounds of respectively Omega(1
Externí odkaz:
http://arxiv.org/abs/2207.09972
Autor:
Krtolica, Predrag V.1 (AUTHOR) krca@pmf.ni.ac.rs, Stanimirović, Predrag S.1,2 (AUTHOR) h677hm@gmail.com, Mašović, Sead H.1 (AUTHOR), Elshaarawy, Islam A.3 (AUTHOR) islam.elshaarawy@feng.bu.edu.eg, Stupina, Alena2 (AUTHOR)
Publikováno v:
Symmetry (20738994). Aug2023, Vol. 15 Issue 8, p1526. 12p.
Autor:
Le, Thong, Gusfield, Dan
The {\it matrix-chain multiplication} problem is a classic problem that is widely taught to illustrate dynamic programming. The textbook solution runs in $\theta(n^3)$ time. However, there is a complex $O(n \log n)$-time method \cite{HU82}, based on
Externí odkaz:
http://arxiv.org/abs/2104.01777
Publikováno v:
Filomat, 2001 Jan 01. 15, 25-33.
Externí odkaz:
https://www.jstor.org/stable/26453402
Autor:
Predrag V. Krtolica, Predrag S. Stanimirović, Sead H. Mašović, Islam A. Elshaarawy, Alena Stupina
Publikováno v:
Symmetry, Vol 15, Iss 8, p 1526 (2023)
A polygon with n nodes can be divided into two subpolygons by an internal diagonal through node n. Splitting the polygon along diagonal δi,n and diagonal δn−i,n, i∈{2,…,⌊n/2⌋} results in mirror images. Obviously, there are ⌊n/2⌋−1 p
Externí odkaz:
https://doaj.org/article/276c65c5d5af46b49988ebe29b824884
Publikováno v:
Lecture Notes in Electrical EngineeringVolume 212, 2013, pp 979-988
A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer sliver tria
Externí odkaz:
http://arxiv.org/abs/1212.6038
Autor:
SARAČEVIĆ, Muzafer1, SELIMI, Aybeyan2 aybeyan@vizyon.edu.mk
Publikováno v:
Turkish Journal of Electrical Engineering & Computer Sciences. 2019, Vol. 27 Issue 1, p346-361. 16p.
Kniha
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.
Publikováno v:
Yugoslav Journal of Operations Research, Vol 13, Iss 1, Pp 61-67 (2003)
In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated" to the arithmetic expression fie
Externí odkaz:
https://doaj.org/article/685820c28bb24568b276e9f47be36e1f