Triangularea unui poligon (Romanian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Triangularea unui poligon" in Romanian language version.
refsWebsite
Global rank
Romanian rank
5th place
11th place
18th place
27th place
3,230th place
10th place
6th place
23rd place
1st place
1st place
ams.org
- en Tarjan, Robert E.; Van Wyk, Christopher J. (), „An O(n log log n)-time algorithm for triangulating a simple polygon”, SIAM Journal on Computing, 17 (1): 143–178, CiteSeerX 10.1.1.186.5949
, doi:10.1137/0217010, MR 0925194 - en Kirkpatrick, David G.; Klawe, Maria M.; Tarjan, Robert E. (), „Polygon triangulation in O(n log log n) time with simple data structures”, Discrete & Computational Geometry, 7 (4): 329–346, doi:10.1007/BF02187846 , MR 1148949
- en Clarkson, Kenneth L.; Cole, Richard; Tarjan, Robert E. (), „Randomized parallel algorithms for trapezoidal diagrams”, International Journal of Computational Geometry & Applications, 2 (2): 117–133, doi:10.1142/S0218195992000081, MR 1168952
archive.org
- en de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (), „3: Polygon Triangulation”, Computational Geometry
(ed. 2nd), Springer-Verlag, pp. 45–61, ISBN 3-540-65620-0
arxiv.org
- en Eppstein, David (), „Counting polygon triangulations is hard”, Proc. 35nd Int. Symp. Computational Geometry, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl, pp. 33:1–33:17, arXiv:1903.04737 , doi:10.4230/LIPIcs.SoCG.2019.33
dexonline.ro
- „triangulare” la DEX online
doi.org
- en Fournier, Alain; Montuno, Delfin Y. (), „Triangulating simple polygons and equivalent problems”, ACM Transactions on Graphics, 3 (2): 153–174, doi:10.1145/357337.357341, ISSN 0730-0301
- en Toussaint, Godfried T. (), „A new linear algorithm for triangulating monotone polygons”, Pattern Recognition Letters, 2 (3): 155–158, Bibcode:1984PaReL...2..155T, doi:10.1016/0167-8655(84)90039-4
- en Meisters, Gary Hosler (), „Polygons have ears”, American Mathematical Monthly, 82 (6): 648–651, doi:10.2307/2319703, JSTOR 2319703
- en ElGindy, Hossam; Everett, Hazel; Toussaint, Godfried T. (), „Slicing an ear using prune-and-search”, Pattern Recognition Letters, 14 (9): 719–722, Bibcode:1993PaReL..14..719E, doi:10.1016/0167-8655(93)90141-y
- en Tarjan, Robert E.; Van Wyk, Christopher J. (), „An O(n log log n)-time algorithm for triangulating a simple polygon”, SIAM Journal on Computing, 17 (1): 143–178, CiteSeerX 10.1.1.186.5949 , doi:10.1137/0217010, MR 0925194
- en Kirkpatrick, David G.; Klawe, Maria M.; Tarjan, Robert E. (), „Polygon triangulation in O(n log log n) time with simple data structures”, Discrete & Computational Geometry, 7 (4): 329–346, doi:10.1007/BF02187846 , MR 1148949
- en Clarkson, Kenneth L.; Tarjan, Robert; van Wyk, Christopher J. (), „A fast Las Vegas algorithm for triangulating a simple polygon”, Discrete & Computational Geometry, 4 (5): 423–432, doi:10.1007/BF02187741
- en Seidel, Raimund (), „A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons”, Computational Geometry, 1: 51–64, doi:10.1016/0925-7721(91)90012-4
- en Clarkson, Kenneth L.; Cole, Richard; Tarjan, Robert E. (), „Randomized parallel algorithms for trapezoidal diagrams”, International Journal of Computational Geometry & Applications, 2 (2): 117–133, doi:10.1142/S0218195992000081, MR 1168952
- en Chazelle, Bernard (), „Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703 , ISSN 0179-5376
- en Amato, Nancy M.; Goodrich, Michael T.; Ramos, Edgar A. (), „A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 26 (2): 245–265, doi:10.1007/s00454-001-0027-x , ISSN 0179-5376, arhivat din original la , accesat în
- en Li, Fajie; Klette, Reinhard (), Euclidean Shortest Paths, Springer, doi:10.1007/978-1-4471-2256-2, ISBN 978-1-4471-2255-5
- en Epstein, Peter; Sack, Jörg-Rüdiger (), „Generating triangulations at random”, ACM Transactions on Modeling and Computer Simulation, 4 (3): 267–278, doi:10.1145/189443.189446
- en Eppstein, David (), „Counting polygon triangulations is hard”, Proc. 35nd Int. Symp. Computational Geometry, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl, pp. 33:1–33:17, arXiv:1903.04737 , doi:10.4230/LIPIcs.SoCG.2019.33
harvard.edu
adsabs.harvard.edu
- en Toussaint, Godfried T. (), „A new linear algorithm for triangulating monotone polygons”, Pattern Recognition Letters, 2 (3): 155–158, Bibcode:1984PaReL...2..155T, doi:10.1016/0167-8655(84)90039-4
- en ElGindy, Hossam; Everett, Hazel; Toussaint, Godfried T. (), „Slicing an ear using prune-and-search”, Pattern Recognition Letters, 14 (9): 719–722, Bibcode:1993PaReL..14..719E, doi:10.1016/0167-8655(93)90141-y
jstor.org
- en Meisters, Gary Hosler (), „Polygons have ears”, American Mathematical Monthly, 82 (6): 648–651, doi:10.2307/2319703, JSTOR 2319703
psu.edu
citeseerx.ist.psu.edu
- en Tarjan, Robert E.; Van Wyk, Christopher J. (), „An O(n log log n)-time algorithm for triangulating a simple polygon”, SIAM Journal on Computing, 17 (1): 143–178, CiteSeerX 10.1.1.186.5949 , doi:10.1137/0217010, MR 0925194
tamu.edu
parasol.tamu.edu
- en Amato, Nancy M.; Goodrich, Michael T.; Ramos, Edgar A. (), „A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 26 (2): 245–265, doi:10.1007/s00454-001-0027-x , ISSN 0179-5376, arhivat din original la , accesat în
unl.edu
digitalcommons.unl.edu
- en Meisters, Gary Hosler (), „Polygons have ears”, American Mathematical Monthly, 82 (6): 648–651, doi:10.2307/2319703, JSTOR 2319703
web.archive.org
- en Amato, Nancy M.; Goodrich, Michael T.; Ramos, Edgar A. (), „A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 26 (2): 245–265, doi:10.1007/s00454-001-0027-x , ISSN 0179-5376, arhivat din original la , accesat în
worldcat.org
- en Fournier, Alain; Montuno, Delfin Y. (), „Triangulating simple polygons and equivalent problems”, ACM Transactions on Graphics, 3 (2): 153–174, doi:10.1145/357337.357341, ISSN 0730-0301
- en Chazelle, Bernard (), „Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 6 (3): 485–524, doi:10.1007/BF02574703 , ISSN 0179-5376
- en Amato, Nancy M.; Goodrich, Michael T.; Ramos, Edgar A. (), „A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time”, Discrete & Computational Geometry, 26 (2): 245–265, doi:10.1007/s00454-001-0027-x , ISSN 0179-5376, arhivat din original la , accesat în