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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Data type polygon”
Simple polygons with an infinite sequence of deflations.
A linear-time construction of Reuleaux polygons.
Kupitz, Yaakov, Martini, Horst, Wegner, Bernd (1996)
Beiträge zur Algebra und Geometrie
Similarity:
On polygons and polyhedra
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity:
A convex polygon as a discrete plane curve.
Góźdź, Stanisław (1999)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
Divisible tilings in the hyperbolic plane.
Broughton, S.Allen, Haney, Dawn M., McKeough, Lori T., Smith Mayfield, Brandy (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
On equations and properties concerning some classes of chordal polygons.
Radić, M., Pogány, T.K., Kadum, V. (2003)
Balkan Journal of Geometry and its Applications (BJGA)
Similarity:
The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Blueprint for a classic proof of the 4 colour theorem
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
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...
The rectilinear crossing number of is 62.
Brodsky, Alex, Durocher, Stephane, Gethner, Ellen (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity: