Polygon partition (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Polygon partition" in English language version.

refsWebsite

Global rank English rank

19doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

6worldcat.org

5^th place

2siam.org

low place

6,473^rd place

2arxiv.org

69^th place

59^th place

2springer.com

274^th place

309^th place

1psu.edu

207^th place

136^th place

1stackexchange.com

1,983^rd place

1,330^th place

1mit.edu

415^th place

327^th place

1worldscientific.com

low place

9,148^th place

1handle.net

102^nd place

76^th place

1cccg.ca

low place

arxiv.org (Global: 69^th place; English: 59^th place)

Akopyan, Arseniy; Segal-Halevi, Erel (2018-01-01). "Counting Blanks in Polygonal Arrangements". SIAM Journal on Discrete Mathematics. 32 (3): 2242–2257. arXiv:1604.00960. doi:10.1137/16M110407X. ISSN 0895-4801. S2CID 123397485.
Nandakumar, R.; Rao, N. Ramana (August 2012). "'Fair' Partitions of Polygons - an Introduction". Proceedings - Mathematical Sciences. 122 (3): 459–467. arXiv:0812.2241. doi:10.1007/s12044-012-0076-5. ISSN 0253-4142. S2CID 189909962.

cccg.ca (Global: low place; English: low place)

H. Everett; W. Lenhart; M. Overmars; T. Shermer; J. Urrutia. (1992). "Strictly convex quadrilateralizations of polygons" (PDF). Proc. 4th Canad. Conf. Comput. Geom. pp. 77–83.

doi.org (Global: 2^nd place; English: 2^nd place)

Mark Keil, J. (2000). "Polygon Decomposition". Handbook of Computational Geometry. pp. 491–518. doi:10.1016/B978-044482537-7/50012-7. ISBN 9780444825377.
Eppstein, David (2010). "Graph-Theoretic Solutions to Computational Geometry Problems". Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Vol. 5911. pp. 1–16. CiteSeerX 10.1.1.249.5965. doi:10.1007/978-3-642-11409-0_1. ISBN 978-3-642-11408-3. S2CID 16353114.
Du, Ding-Zhu; Ko, Ker-I.; Hu, Xiaodong (2012). Design and Analysis of Approximation Algorithms. Springer Optimization and Its Applications. New York: Springer-Verlag. pp. 165–209. doi:10.1007/978-1-4614-1701-9_5. ISBN 978-1-4614-1700-2.
Gonzalez, Teofilo; Zheng, Si-Qing (1985-06-01). "Bounds for partitioning rectilinear polygons". Proceedings of the first annual symposium on Computational geometry - SCG '85. Baltimore, Maryland, USA: Association for Computing Machinery. pp. 281–287. doi:10.1145/323233.323269. ISBN 978-0-89791-163-4. S2CID 12588297.
Levcopoulos, C (1986-08-01). "Fast heuristics for minimum length rectangular partitions of polygons". Proceedings of the second annual symposium on Computational geometry - SCG '86. Yorktown Heights, New York, USA: Association for Computing Machinery. pp. 100–108. doi:10.1145/10515.10526. ISBN 978-0-89791-194-8. S2CID 16106423.
Gonzalez, Teofilo F.; Razzazi, Mohammadreza; Zheng, Si-Qing (1993-12-01). "An efficient divide-and-conquer approximation algorithm for partitioning into d-boxes". International Journal of Computational Geometry & Applications. 03 (4): 417–428. doi:10.1142/S0218195993000269. ISSN 0218-1959.
Gonzalez, Teofilo; Zheng, Si-Qing (1989-06-01). "Improved bounds for rectangular and guillotine partitions". Journal of Symbolic Computation. 7 (6): 591–610. doi:10.1016/S0747-7171(89)80042-2. ISSN 0747-7171.
Arora, S. (October 1996). "Polynomial time approximation schemes for Euclidean TSP and other geometric problems". Proceedings of 37th Conference on Foundations of Computer Science. pp. 2–11. doi:10.1109/SFCS.1996.548458. ISBN 0-8186-7594-2. S2CID 1499391.
Mitchell, Joseph S. B. (1999-01-01). "Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems". SIAM Journal on Computing. 28 (4): 1298–1309. doi:10.1137/S0097539796309764. ISSN 0097-5397.
Akopyan, Arseniy; Segal-Halevi, Erel (2018-01-01). "Counting Blanks in Polygonal Arrangements". SIAM Journal on Discrete Mathematics. 32 (3): 2242–2257. arXiv:1604.00960. doi:10.1137/16M110407X. ISSN 0895-4801. S2CID 123397485.
Asano, Takao; Asano, Tetsuo; Imai, Hiroshi (1986). "Partitioning a polygonal region into trapezoids". Journal of the ACM. 33 (2): 290. doi:10.1145/5383.5387. hdl:2433/98478. S2CID 15296037.
Chazelle, Bernard (2007). "Triangulating a simple polygon in linear time". Discrete & Computational Geometry. 6 (3): 485–524. doi:10.1007/bf02574703.
Ramaswami, Suneeta; Ramos, Pedro; Toussaint, Godfried (1998). "Converting triangulations to quadrangulations". Computational Geometry. 9 (4): 257. doi:10.1016/s0925-7721(97)00019-9.
Lingas, Andrzej; Levcopoulos, Christos; Sack, Jörg (1987). "Algorithms for minimum length partitions of polygons". BIT Numerical Mathematics. 27 (4): 474. doi:10.1007/bf01937272. S2CID 30936524.
Levcopoulos, Christos; Lingas, Andrzej; Sack, Jörg-R. (1989). "Heuristics for optimum binary search trees and minimum weight triangulation problems". Theoretical Computer Science. 66 (2): 181. doi:10.1016/0304-3975(89)90134-5.
Hertel, Stefan; Mehlhorn, Kurt (1983). "Fast triangulation of simple polygons". In Karpinski, Marek (ed.). Foundations of Computation Theory. Lecture Notes in Computer Science. Vol. 158. Berlin, Heidelberg: Springer. pp. 207–218. doi:10.1007/3-540-12689-9_105. ISBN 978-3-540-38682-7.
Nandakumar, R.; Rao, N. Ramana (August 2012). "'Fair' Partitions of Polygons - an Introduction". Proceedings - Mathematical Sciences. 122 (3): 459–467. arXiv:0812.2241. doi:10.1007/s12044-012-0076-5. ISSN 0253-4142. S2CID 189909962.
Armaselu, Bogdan; Daescu, Ovidiu (2015-11-23). "Algorithms for fair partitioning of convex polygons". Theoretical Computer Science. 607: 351–362. doi:10.1016/j.tcs.2015.08.003. ISSN 0304-3975.
Bespamyatnikh, Sergei (2003). "On Partitioning a Cake". In Akiyama, Jin; Kano, Mikio (eds.). Discrete and Computational Geometry: Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science. Vol. 2866. Berlin, Heidelberg: Springer. pp. 60–71. doi:10.1007/978-3-540-44400-8_7. ISBN 978-3-540-44400-8.

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Asano, Takao; Asano, Tetsuo; Imai, Hiroshi (1986). "Partitioning a polygonal region into trapezoids". Journal of the ACM. 33 (2): 290. doi:10.1145/5383.5387. hdl:2433/98478. S2CID 15296037.

mit.edu (Global: 415^th place; English: 327^th place)

people.csail.mit.edu

Andrzej Lingas and Ron Y Pinter and Ron L Rivest and Adi Shamir (1982). "Minimum edge length partitioning of rectilinear polygons" (PDF). Proc. 20th Allerton Conf. Commun. Control Comput: 53–63.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Eppstein, David (2010). "Graph-Theoretic Solutions to Computational Geometry Problems". Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Vol. 5911. pp. 1–16. CiteSeerX 10.1.1.249.5965. doi:10.1007/978-3-642-11409-0_1. ISBN 978-3-642-11408-3. S2CID 16353114.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Eppstein, David (2010). "Graph-Theoretic Solutions to Computational Geometry Problems". Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Vol. 5911. pp. 1–16. CiteSeerX 10.1.1.249.5965. doi:10.1007/978-3-642-11409-0_1. ISBN 978-3-642-11408-3. S2CID 16353114.
Gonzalez, Teofilo; Zheng, Si-Qing (1985-06-01). "Bounds for partitioning rectilinear polygons". Proceedings of the first annual symposium on Computational geometry - SCG '85. Baltimore, Maryland, USA: Association for Computing Machinery. pp. 281–287. doi:10.1145/323233.323269. ISBN 978-0-89791-163-4. S2CID 12588297.
Levcopoulos, C (1986-08-01). "Fast heuristics for minimum length rectangular partitions of polygons". Proceedings of the second annual symposium on Computational geometry - SCG '86. Yorktown Heights, New York, USA: Association for Computing Machinery. pp. 100–108. doi:10.1145/10515.10526. ISBN 978-0-89791-194-8. S2CID 16106423.
Arora, S. (October 1996). "Polynomial time approximation schemes for Euclidean TSP and other geometric problems". Proceedings of 37th Conference on Foundations of Computer Science. pp. 2–11. doi:10.1109/SFCS.1996.548458. ISBN 0-8186-7594-2. S2CID 1499391.
Akopyan, Arseniy; Segal-Halevi, Erel (2018-01-01). "Counting Blanks in Polygonal Arrangements". SIAM Journal on Discrete Mathematics. 32 (3): 2242–2257. arXiv:1604.00960. doi:10.1137/16M110407X. ISSN 0895-4801. S2CID 123397485.
Asano, Takao; Asano, Tetsuo; Imai, Hiroshi (1986). "Partitioning a polygonal region into trapezoids". Journal of the ACM. 33 (2): 290. doi:10.1145/5383.5387. hdl:2433/98478. S2CID 15296037.
Lingas, Andrzej; Levcopoulos, Christos; Sack, Jörg (1987). "Algorithms for minimum length partitions of polygons". BIT Numerical Mathematics. 27 (4): 474. doi:10.1007/bf01937272. S2CID 30936524.
Nandakumar, R.; Rao, N. Ramana (August 2012). "'Fair' Partitions of Polygons - an Introduction". Proceedings - Mathematical Sciences. 122 (3): 459–467. arXiv:0812.2241. doi:10.1007/s12044-012-0076-5. ISSN 0253-4142. S2CID 189909962.

siam.org (Global: low place; English: 6,473^rd place)

epubs.siam.org

Mitchell, Joseph S. B. (1999-01-01). "Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems". SIAM Journal on Computing. 28 (4): 1298–1309. doi:10.1137/S0097539796309764. ISSN 0097-5397.
Akopyan, Arseniy; Segal-Halevi, Erel (2018-01-01). "Counting Blanks in Polygonal Arrangements". SIAM Journal on Discrete Mathematics. 32 (3): 2242–2257. arXiv:1604.00960. doi:10.1137/16M110407X. ISSN 0895-4801. S2CID 123397485.

springer.com (Global: 274^th place; English: 309^th place)

springer.com

Du, Ding-Zhu; Ko, Ker-I.; Hu, Xiaodong (2012). Design and Analysis of Approximation Algorithms. Springer Optimization and Its Applications. New York: Springer-Verlag. pp. 165–209. doi:10.1007/978-1-4614-1701-9_5. ISBN 978-1-4614-1700-2.

link.springer.com

Hertel, Stefan; Mehlhorn, Kurt (1983). "Fast triangulation of simple polygons". In Karpinski, Marek (ed.). Foundations of Computation Theory. Lecture Notes in Computer Science. Vol. 158. Berlin, Heidelberg: Springer. pp. 207–218. doi:10.1007/3-540-12689-9_105. ISBN 978-3-540-38682-7.

stackexchange.com (Global: 1,983^rd place; English: 1,330^th place)

cs.stackexchange.com

Realz Slaw. "Tiling an orthogonal polygon with squares". CS stack exchange. Retrieved 19 October 2015.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Gonzalez, Teofilo F.; Razzazi, Mohammadreza; Zheng, Si-Qing (1993-12-01). "An efficient divide-and-conquer approximation algorithm for partitioning into d-boxes". International Journal of Computational Geometry & Applications. 03 (4): 417–428. doi:10.1142/S0218195993000269. ISSN 0218-1959.
Gonzalez, Teofilo; Zheng, Si-Qing (1989-06-01). "Improved bounds for rectangular and guillotine partitions". Journal of Symbolic Computation. 7 (6): 591–610. doi:10.1016/S0747-7171(89)80042-2. ISSN 0747-7171.
Mitchell, Joseph S. B. (1999-01-01). "Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems". SIAM Journal on Computing. 28 (4): 1298–1309. doi:10.1137/S0097539796309764. ISSN 0097-5397.
Akopyan, Arseniy; Segal-Halevi, Erel (2018-01-01). "Counting Blanks in Polygonal Arrangements". SIAM Journal on Discrete Mathematics. 32 (3): 2242–2257. arXiv:1604.00960. doi:10.1137/16M110407X. ISSN 0895-4801. S2CID 123397485.
Nandakumar, R.; Rao, N. Ramana (August 2012). "'Fair' Partitions of Polygons - an Introduction". Proceedings - Mathematical Sciences. 122 (3): 459–467. arXiv:0812.2241. doi:10.1007/s12044-012-0076-5. ISSN 0253-4142. S2CID 189909962.
Armaselu, Bogdan; Daescu, Ovidiu (2015-11-23). "Algorithms for fair partitioning of convex polygons". Theoretical Computer Science. 607: 351–362. doi:10.1016/j.tcs.2015.08.003. ISSN 0304-3975.

worldscientific.com (Global: low place; English: 9,148^th place)

Gonzalez, Teofilo F.; Razzazi, Mohammadreza; Zheng, Si-Qing (1993-12-01). "An efficient divide-and-conquer approximation algorithm for partitioning into d-boxes". International Journal of Computational Geometry & Applications. 03 (4): 417–428. doi:10.1142/S0218195993000269. ISSN 0218-1959.

Polygon partition (English Wikipedia)

arxiv.org (Global: 69th place; English: 59th place)

cccg.ca (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

mit.edu (Global: 415th place; English: 327th place)

people.csail.mit.edu

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

siam.org (Global: low place; English: 6,473rd place)

epubs.siam.org

springer.com (Global: 274th place; English: 309th place)

springer.com

link.springer.com

stackexchange.com (Global: 1,983rd place; English: 1,330th place)

cs.stackexchange.com

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

worldscientific.com (Global: low place; English: 9,148th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

handle.net (Global: 102^nd place; English: 76^th place)

mit.edu (Global: 415^th place; English: 327^th place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

siam.org (Global: low place; English: 6,473^rd place)

springer.com (Global: 274^th place; English: 309^th place)

stackexchange.com (Global: 1,983^rd place; English: 1,330^th place)

worldcat.org (Global: 5^th place; English: 5^th place)

worldscientific.com (Global: low place; English: 9,148^th place)