Joseph O'Rourke
Reputation
388/400 score
 2d comment Number of facets of a polyhedron when a vertex is removed I suggest rephrasing "chopped off," which suggests truncation, to "removal," which is what is intended. Feb 4 awarded Popular Question Jan 21 awarded Popular Question Jan 20 awarded discrete-geometry Jan 20 revised Orthogonal embeddings and edge lengths Added link for first reference. Jan 20 answered Orthogonal embeddings and edge lengths Jan 18 comment The volume of a region arising from planar linkages There seem to be no variables: $x_0,\dots,x_n$ and $c$ are fixed. Or do you mean that $x_0,\dots,x_n$ are variable and only $c$ is fixed? Jan 17 comment Does a planar triangulation always contain a Hamiltonian path? The answer is still No, but now you need a maximal planar triangulated graph with at least $8$ "separating triangles." This is easily constructed, and it has no Hamiltonian path. Jan 17 revised Does a planar triangulation always contain a Hamiltonian path? added 278 characters in body Jan 17 revised Does a planar triangulation always contain a Hamiltonian path? added 278 characters in body Jan 17 revised Does a planar triangulation always contain a Hamiltonian path? added 278 characters in body Jan 17 revised Does a planar triangulation always contain a Hamiltonian path? added 278 characters in body Jan 17 revised Does a planar triangulation always contain a Hamiltonian path? added 142 characters in body Jan 17 answered Does a planar triangulation always contain a Hamiltonian path? Jan 16 comment What is the actual meaning of a fractional derivative? Subsequently, there has been an illuminating answer to a related question, "Geometric interpretation of the half-derivative?". In particular, there is a beautiful "mechanical interpretation of the half-derivative." Jan 13 answered Cluster Variables for non-convex n-gons Jan 12 comment Cluster Variables for non-convex n-gons Perhaps you could provide a reference that shows "mutations of the diagonals of a convex n-gon" in this context? Thanks. Jan 12 comment Building an orthogonal embedding for a 4-planar graph This doesn't answer your question, but perhaps you are aware that the state-of-the-art has advanced since that 1981 paper. E.g., Cornelsen, Sabine, and Andreas Karrenbauer. "Accelerated bend minimization." Graph Drawing. Springer Berlin Heidelberg, 2012. They compute a min bend drawing in subquadratic time. Jan 10 comment The center of a minimal convex superbody What does " $\ B\ C\subseteq\mathbb R^n\$" mean? That both $B$ and $C$ are subsets of $\mathbb{R}^n$, or that some product of $B$ and $C$ is? Jan 10 revised Locked convex polyhedra added 3 characters in body