-
Notifications
You must be signed in to change notification settings - Fork 10
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
parametrization of non-convex polygons, flat disks and flat spheres #31
Comments
@wphooper Pat, do you know the answer to the "possibly interesting question" ? I think it is worth investigating how much the boundary gives you information on a flat disk. |
There is a numerical approach to this. Consider a tuple of integers
with One can even compute a combinatorial triangulation (close to the Delaunay cell decomposition) by integrating the linear flow. If there are two flat disks with the same boundary it means that there are two tuples of |
This is related to #170. I'm not sure what you had in mind here @videlec. Should flat disks (and spheres?) be fundamental building blocks of surfaces like polygons are currently? Or do you just want to create a flat disk with a convenience function that produces a gadget that is built from polygons glued to the flat disk and that can then be used to build more complex surfaces. |
I don't think that flat disks should be any special : they are translation surfaces with boundary (that happen to be homeomorphic to a disk). I just wanted some convenience functions. In particular, given boundary segments, it should be possible to build all flat disks whose boundary is made of the segments. |
I don't understand this comment.
So, if I take a₁, a₂, a₃ = 1 (an equilateral triangle), I just get dz. From what you wrote it would seem that I can choose the pk however I want but then I won't get three equal side lengths for my equilateral triangle.
I don't understand this. Didn't you say above that I get a flat disk with these angles already without fixing the points like that? Sorry, for asking these questions two years after the fact but I was looking into whether it's worthwhile to implement this now and I would like to understand the idea here. |
The
EquiangularPolygons
class allows to play with polygons where angles are fixed. However, it does not handle gracefully the non-convex case where intersections might occur. The parameter space for the lengths is an a priori complicated space since each intersection of segments gives a quadratic equation.Perhaps, non-convex polygons is the wrong question and one should look at equiangular flat disks. In many situation, such generalized polygons would be used as a building block for a translation surface or conical surface (such as the double in the billiard construction).
In these three settings (polygons with fixed boundary angles, flat disks with fixed boundary angles, flat spheres with fixed conical angles) it would be nice to implement algorithms for
A possibly interesting question : let us start with a "piecewise linear curve" given as a sequence of
n
lengths and interior angles such that the curve closes up and the total interior angle is(n-2) \pi
. Does such curve necessarily correspond to the boundary of at least one flat disk? Always to finitely many flat disks? Can we parametrize all flat disks with this boundary by some combinatorial decoration?The article https://arxiv.org/pdf/2008.10192.pdf might be helpful.
See also #61
The text was updated successfully, but these errors were encountered: