Jay Lemmon
Reputation
678
Next privilege 1,000 Rep.
Create tags
 Apr12 comment Angle Sum of Self-intersecting polygon Hmm, I think the wording of "you get exactly $\pm2\pi$ if the polygon is not self-intersecting" is maybe a little awkward if you didn't mean it as necessary and sufficient. Especially in the context of the OP's question: "Do you think that this can be related to the number of points of intersection or something else?". But reading it again, now, you don't explicitly say anything that would mean sufficient. But I had to read things very carefully not to draw that conclusion. Apr11 comment Angle Sum of Self-intersecting polygon I think this is only partially right: I think summing to $\pm 2 \pi$ is a necessary but not sufficient condition for not self-intersecting. I seem to be able to come up with polygons where the intersection occurs between edges separated by more than two vertices (so an edge and its neighbor's neighbor), and yet the angles sum to $2\pi$. Mar31 comment Parameterizing equilateral polygons I tried searching for things online but I'm apparently not very good at it haha :) I'll look at the links you give. What search terms are you using to search with? Mar31 asked Parameterizing equilateral polygons Dec24 accepted How many orthogonal matrices map one vector to another? Dec14 awarded Nice Question Dec8 comment How many orthogonal matrices map one vector to another? Ah, simple once I see it :) Thanks! Dec8 asked How many orthogonal matrices map one vector to another? Dec5 asked Decomposing a Householder transformation? Oct9 asked $C^{\infty}$ distance function for polygons? Oct7 awarded Revival Oct1 answered Calculators using Taylor polynomials? Sep24 awarded Autobiographer Sep23 asked Rotations and inequalities Sep19 comment LQ decomposition and inequalities Ah, interesting :) And very frustrating for what I'm doing, but oh well. Sep19 accepted LQ decomposition and inequalities Sep19 awarded Yearling Sep19 asked LQ decomposition and inequalities Sep9 awarded Popular Question Aug29 comment Reentrant constraints in active set algorithm? I know, just pointing out the convexity can matter.