Dual polyhedron (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dual polyhedron" in English language version.

refsWebsite

Global rank English rank

6ams.org

451^st place

277^th place

3doi.org

2^nd place

1psu.edu

207^th place

136^th place

1semanticscholar.org

11^th place

8^th place

1handle.net

102^nd place

76^th place

1dmccooey.com

low place

1anu.edu.au

942^nd place

597^th place

ams.org

mathscinet.ams.org

Wenninger (1983), "Basic notions about stellation and duality", p. 1. Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.
Grünbaum (2003) Grünbaum, Branko (2003), "Are your polyhedra the same as my polyhedra?", in Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.), Discrete and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102.755, doi:10.1007/978-3-642-55566-4_21, ISBN 978-3-642-62442-1, MR 2038487.
Cundy & Rollett (1961), 3.2 Duality, pp. 78–79; Wenninger (1983), Pages 3-5. (Note, Wenninger's discussion includes nonconvex polyhedra.) Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.
See for example Grünbaum & Shephard (2013), and Gailiunas & Sharp (2005). Wenninger (1983) also discusses some issues on the way to deriving his infinite duals. Grünbaum, Branko; Shephard, G. C. (2013), "Duality of polyhedra", in Senechal, Marjorie (ed.), Shaping Space: Exploring polyhedra in nature, art, and the geometrical imagination, New York: Springer, pp. 211–216, doi:10.1007/978-0-387-92714-5_15, ISBN 978-0-387-92713-8, MR 3077226. Gailiunas, P.; Sharp, J. (2005), "Duality of polyhedra", International Journal of Mathematical Education in Science and Technology, 36 (6): 617–642, doi:10.1080/00207390500064049, S2CID 120818796. Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.
Grünbaum (2007), Theorem 3.1, p. 449. Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs", Discrete Mathematics, 307 (3–5): 445–463, doi:10.1016/j.disc.2005.09.037, hdl:1773/2276, MR 2287486.
Cundy & Rollett (1961), p. 117; Wenninger (1983), p. 30. Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.

anu.edu.au

cs.anu.edu.au

3D Java models at Symmetries of Canonical Self-Dual Polyhedra, based on paper by Gunnar Brinkmann, Brendan D. McKay, Fast generation of planar graphs PDF [1]

dmccooey.com

3D Java models at Symmetries of Canonical Self-Dual Polyhedra, based on paper by Gunnar Brinkmann, Brendan D. McKay, Fast generation of planar graphs PDF [1]

doi.org

Grünbaum (2003) Grünbaum, Branko (2003), "Are your polyhedra the same as my polyhedra?", in Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.), Discrete and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102.755, doi:10.1007/978-3-642-55566-4_21, ISBN 978-3-642-62442-1, MR 2038487.
See for example Grünbaum & Shephard (2013), and Gailiunas & Sharp (2005). Wenninger (1983) also discusses some issues on the way to deriving his infinite duals. Grünbaum, Branko; Shephard, G. C. (2013), "Duality of polyhedra", in Senechal, Marjorie (ed.), Shaping Space: Exploring polyhedra in nature, art, and the geometrical imagination, New York: Springer, pp. 211–216, doi:10.1007/978-0-387-92714-5_15, ISBN 978-0-387-92713-8, MR 3077226. Gailiunas, P.; Sharp, J. (2005), "Duality of polyhedra", International Journal of Mathematical Education in Science and Technology, 36 (6): 617–642, doi:10.1080/00207390500064049, S2CID 120818796. Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.
Grünbaum (2007), Theorem 3.1, p. 449. Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs", Discrete Mathematics, 307 (3–5): 445–463, doi:10.1016/j.disc.2005.09.037, hdl:1773/2276, MR 2287486.

handle.net

hdl.handle.net

Grünbaum (2007), Theorem 3.1, p. 449. Grünbaum, Branko (2007), "Graphs of polyhedra; polyhedra as graphs", Discrete Mathematics, 307 (3–5): 445–463, doi:10.1016/j.disc.2005.09.037, hdl:1773/2276, MR 2287486.

psu.edu

citeseerx.ist.psu.edu

Grünbaum (2003) Grünbaum, Branko (2003), "Are your polyhedra the same as my polyhedra?", in Aronov, Boris; Basu, Saugata; Pach, János; Sharir, Micha (eds.), Discrete and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102.755, doi:10.1007/978-3-642-55566-4_21, ISBN 978-3-642-62442-1, MR 2038487.

semanticscholar.org

api.semanticscholar.org

See for example Grünbaum & Shephard (2013), and Gailiunas & Sharp (2005). Wenninger (1983) also discusses some issues on the way to deriving his infinite duals. Grünbaum, Branko; Shephard, G. C. (2013), "Duality of polyhedra", in Senechal, Marjorie (ed.), Shaping Space: Exploring polyhedra in nature, art, and the geometrical imagination, New York: Springer, pp. 211–216, doi:10.1007/978-0-387-92714-5_15, ISBN 978-0-387-92713-8, MR 3077226. Gailiunas, P.; Sharp, J. (2005), "Duality of polyhedra", International Journal of Mathematical Education in Science and Technology, 36 (6): 617–642, doi:10.1080/00207390500064049, S2CID 120818796. Wenninger, Magnus (1983), Dual Models, Cambridge University Press, ISBN 0-521-54325-8, MR 0730208.