Simple polygons with an infinite sequence of deflations.
Fevens, Thomas, Hernandez, Antonio, Mesa, Antonio, Morin, Patrick, Soss, Michael, Toussaint, Godfried (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Fevens, Thomas, Hernandez, Antonio, Mesa, Antonio, Morin, Patrick, Soss, Michael, Toussaint, Godfried (2001)
Beiträge zur Algebra und Geometrie
Similarity:
Kupitz, Yaakov, Martini, Horst, Wegner, Bernd (1996)
Beiträge zur Algebra und Geometrie
Similarity:
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity:
Góźdź, Stanisław (1999)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Radić, M., Pogány, T.K., Kadum, V. (2003)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Mirzoev, Tigran, Vassilev, Tzvetalin (2010)
Serdica Journal of Computing
Similarity:
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2...
Brodsky, Alex, Durocher, Stephane, Gethner, Ellen (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity: