Blooming (geometry) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Blooming (geometry)" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

3ams.org

451^st place

277^th place

3semanticscholar.org

11^th place

8^th place

1handle.net

102^nd place

76^th place

1web.archive.org

1^st place

1technion.ac.il

low place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Biedl, Therese; Lubiw, Anna; Sun, Julie (2005), "When can a net fold to a polyhedron?", Computational Geometry, 31 (3): 207–218, doi:10.1016/j.comgeo.2004.12.004, MR 2143321. Announced at the Canadian Conference on Computational Geometry, 1999.
Miller, Ezra; Pak, Igor (2008), "Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings", Discrete & Computational Geometry, 39 (1–3): 339–388, doi:10.1007/s00454-008-9052-3, MR 2383765. Announced in 2003.
Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph (2011), "Continuous blooming of convex polyhedra", Graphs and Combinatorics, 27 (3): 363–376, doi:10.1007/s00373-011-1024-3, hdl:1721.1/67481, MR 2787423, S2CID 82408. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.

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

Biedl, Therese; Lubiw, Anna; Sun, Julie (2005), "When can a net fold to a polyhedron?", Computational Geometry, 31 (3): 207–218, doi:10.1016/j.comgeo.2004.12.004, MR 2143321. Announced at the Canadian Conference on Computational Geometry, 1999.
Miller, Ezra; Pak, Igor (2008), "Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings", Discrete & Computational Geometry, 39 (1–3): 339–388, doi:10.1007/s00454-008-9052-3, MR 2383765. Announced in 2003.
Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph (2011), "Continuous blooming of convex polyhedra", Graphs and Combinatorics, 27 (3): 363–376, doi:10.1007/s00373-011-1024-3, hdl:1721.1/67481, MR 2787423, S2CID 82408. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.
Song, Guang; Amato, N. M. (February 2004), "A motion-planning approach to folding: From paper craft to protein folding", IEEE Transactions on Robotics and Automation, 20 (1): 60–71, doi:10.1109/tra.2003.820926, S2CID 9636
Xi, Zhonghua; Lien, Jyh-Ming (September 2015), "Continuous unfolding of polyhedra – a motion planning approach", 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, pp. 3249–3254, doi:10.1109/iros.2015.7353828, ISBN 978-1-4799-9994-1, S2CID 14376277
Hao, Yue; Kim, Yun-hyeong; Lien, Jyh-Ming (June 2018), "Synthesis of fast and collision-free folding of polyhedral nets", Proceedings of the 2nd ACM Symposium on Computational Fabrication, ACM, pp. 1–10, doi:10.1145/3213512.3213517, ISBN 978-1-4503-5854-5

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

hdl.handle.net

Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph (2011), "Continuous blooming of convex polyhedra", Graphs and Combinatorics, 27 (3): 363–376, doi:10.1007/s00373-011-1024-3, hdl:1721.1/67481, MR 2787423, S2CID 82408. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.

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

api.semanticscholar.org

Demaine, Erik D.; Demaine, Martin L.; Hart, Vi; Iacono, John; Langerman, Stefan; O'Rourke, Joseph (2011), "Continuous blooming of convex polyhedra", Graphs and Combinatorics, 27 (3): 363–376, doi:10.1007/s00373-011-1024-3, hdl:1721.1/67481, MR 2787423, S2CID 82408. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.
Song, Guang; Amato, N. M. (February 2004), "A motion-planning approach to folding: From paper craft to protein folding", IEEE Transactions on Robotics and Automation, 20 (1): 60–71, doi:10.1109/tra.2003.820926, S2CID 9636
Xi, Zhonghua; Lien, Jyh-Ming (September 2015), "Continuous unfolding of polyhedra – a motion planning approach", 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), IEEE, pp. 3249–3254, doi:10.1109/iros.2015.7353828, ISBN 978-1-4799-9994-1, S2CID 14376277

technion.ac.il (Global: low place; English: low place)

www2.math.technion.ac.il

Pak, Igor; Pinchasi, Rom (2009), How to cut out a convex polyhedron (PDF), archived from the original (PDF) on 2021-01-20, retrieved 2021-06-21. As cited by Demaine et al. (2011).

web.archive.org (Global: 1^st place; English: 1^st place)

Pak, Igor; Pinchasi, Rom (2009), How to cut out a convex polyhedron (PDF), archived from the original (PDF) on 2021-01-20, retrieved 2021-06-21. As cited by Demaine et al. (2011).

Blooming (geometry) (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)