Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Convex position
open-in-new
<h2 id="references">References</h2> <ol> <li id="fn:1"><p>Matoušek, Jiří (2002), Lectures on Discrete Geometry, Graduate Texts in Mathematics, Springer-Verlag, p. 30, ISBN 978-0-387-95373-1 <a href="978-0-387-95373-1" target="_blank">978-0-387-95373-1</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Matoušek, Jiří (2002), Lectures on Discrete Geometry, Graduate Texts in Mathematics, Springer-Verlag, p. 30, ISBN 978-0-387-95373-1 <a href="978-0-387-95373-1" target="_blank">978-0-387-95373-1</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Tóth, Géza; Valtr, Pavel (2005), "The Erdős-Szekeres theorem: upper bounds and related results", Combinatorial and computational geometry, Math. Sci. Res. Inst. Publ., vol. 52, Cambridge: Cambridge Univ. Press, pp. 557–568, MR 2178339 <a href="/wiki/MR_(identifier)" target="_blank">/wiki/MR_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Deĭneko, Vladimir G.; Hoffmann, Michael; Okamoto, Yoshio; Woeginger, Gerhard J. (2006), "The traveling salesman problem with few inner points", Operations Research Letters, 34 (1): 106–110, doi:10.1016/j.orl.2005.01.002, MR 2186082 <a href="/wiki/Gerhard_J._Woeginger" target="_blank">/wiki/Gerhard_J._Woeginger</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Mulzer, Wolfgang; Rote, Günter (2008), "Minimum-weight triangulation is NP-hard", Journal of the ACM, 55 (2), Article A11, arXiv:cs.CG/0601002, doi:10.1145/1346330.1346336 <a href="/wiki/Journal_of_the_ACM" target="_blank">/wiki/Journal_of_the_ACM</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Klincsek, G. T. (1980), "Minimal triangulations of polygonal domains", Annals of Discrete Mathematics, 9: 121–123, doi:10.1016/s0167-5060(08)70044-x, ISBN 9780444861115 <a href="9780444861115" target="_blank">9780444861115</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Erdős, Paul; Szekeres, George (1935), "A combinatorial problem in geometry", Compositio Mathematica, 2: 463–470 <a href="/wiki/Paul_Erd%C5%91s" target="_blank">/wiki/Paul_Erd%C5%91s</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Valtr, P. (1995), "Probability that n random points are in convex position", Discrete & Computational Geometry, 13 (3–4): 637–643, doi:10.1007/BF02574070, MR 1318803 <a href="/wiki/Discrete_%26_Computational_Geometry" target="_blank">/wiki/Discrete_%26_Computational_Geometry</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Forge, David; Las Vergnas, Michel; Schuchert, Peter (2001), "10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope", Combinatorial geometries (Luminy, 1999), European Journal of Combinatorics, 22 (5): 705–708, doi:10.1006/eujc.2000.0490, MR 1845494 <a href="/wiki/Michel_Las_Vergnas" target="_blank">/wiki/Michel_Las_Vergnas</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> </ol>