User ramsay - MathOverflowmost recent 30 from http://mathoverflow.net2013-05-24T15:31:15Zhttp://mathoverflow.net/feeds/user/9024http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/86420/delaunay-triangulations-and-convex-hulls/86437#86437Answer by Ramsay for Delaunay triangulations and convex hullsRamsay2012-01-23T11:40:43Z2012-01-23T18:44:26Z<p>This paper by Bobenko and Izmestiev <a href="http://page.math.tu-berlin.de/~bobenko/papers/2008_Bob_Izm_p.pdf" rel="nofollow">"Alexandrov's Theorem, Weighted Delaunay Triangulations, and Mixed Volumes"</a> is based upon a generalization of this observation.</p>
<p>One reason that this convex-hull characterization may seem obscure is that it really only applies to points on the sphere. The paragraph in the OP that begins "There is no reason ..." is misleading because it implies that the planar Delaunay triangulation can be characterized in this way. The lower envelope of the convex hull of the traditional lifting (to a paraboloid) gives exactly the combinatorics of the planar DT. However, going to a sphere, by stereographic projection, say, is only going to work if the radius of the sphere is "big enough". For a fixed number of points n, there will be no upper bound on the radius that is big enough for all point sets of size n.</p>
<p>The Delaunay triangulation is brittle, and unless unusual demands on the vertex configurations are made, the combinatorial structure can change with an arbitrarily small perturbation of the metric. I.e., the point set can be arbitrarily close to being degenerate. </p>
http://mathoverflow.net/questions/54742/gaussian-curvature-radius/55734#55734Answer by Ramsay for Gaussian curvature radiusRamsay2011-02-17T14:00:01Z2011-02-17T14:00:01Z<p>Deane's answer is similar to what I would have tried to say if I'd got here on time. I don't recall seeing the "Gaussian curvature radius" defined before, so I can't point you to other references. The definition is natural. On the one hand the bound on the distance to a conjugate point (Morse-Schönberg lemma) is given in terms of a bound on the Gaussian curvature radius, and on the other hand the Gaussian curvature radius provides an upper bound to the "maximal curvature radius"(reciprocal of the maximum of the absolute values of the principal curvatures). As Deane pointed out, these two curvature radii coincide on the sphere.</p>
<p>Since we are only using it as an upper bound, we just define it to be infinite if the curvature is non-positive. In flat or negatively curved spaces, conjugate points are not an issue; geodesics diverge. </p>
<p>As to your alternative, $\rho_K(x) = 1/\sqrt{|K(x)|}$, I guess it depends on what you want to do. You are making a smaller sizing function, but why? The spirit of the Morse-Schönberg lemma is better captured without the absolute value signs. If the infinite values disturb you, you have not avoided them when the Gaussian curvature vanishes. </p>
http://mathoverflow.net/questions/43408/is-this-formulation-of-the-singular-value-decomposition-standard/43427#43427Answer by Ramsay for Is this formulation of the Singular Value Decomposition standard?Ramsay2010-10-24T20:37:23Z2011-01-07T13:43:46Z<p>The book "Numerical Linear Algebra" by Trefethen and Bau, also introduces the SVD in this way. The relevant chapters (4 and 5) seem to be complete in Google books. The exposition is not tainted by the 'numerical' in the title. </p>
<p>I don't understand why the SVN isn't given more emphasis in standard introductions to linear algebra. It seems to give a good intuitive decomposition of a linear operator. I would expect it to be a useful theoretical tool even if numerical issues are not being considered.</p>
http://mathoverflow.net/questions/43186/finding-cutting-edge-papers-and-books/43197#43197Answer by Ramsay for finding cutting edge papers and booksRamsay2010-10-22T15:59:56Z2010-10-22T15:59:56Z<p>There are some good resources mentioned already on this site. In particular see this question:
<a href="http://mathoverflow.net/questions/2147/most-helpful-math-resources-on-the-web" rel="nofollow">http://mathoverflow.net/questions/2147/most-helpful-math-resources-on-the-web</a></p>
<p>Ryan Budney makes a comment under Thanos D. Papaïoannou's response about MathSciNet. Given any relevant paper on the topic of interest, you can find papers that cite it. </p>
<p>This question may also be worth looking at:
<a href="http://mathoverflow.net/questions/1722/free-high-quality-mathematical-writing-online" rel="nofollow">http://mathoverflow.net/questions/1722/free-high-quality-mathematical-writing-online</a></p>
http://mathoverflow.net/questions/41501/shortest-morphing-between-shapes-embedded-in-mathbbr3/41512#41512Answer by Ramsay for Shortest morphing between shapes embedded in $\mathbb{R}^3$Ramsay2010-10-08T14:18:52Z2010-10-08T14:18:52Z<p>There is another solution in the computer graphics literature that you didn't mention:</p>
<p>Greg Turk and James O'Brien, "Shape Transformation Using Variational Implicit Functions," SIGGRAPH 99, August 1999, pp. 335-342. </p>
<p><a href="http://www.cc.gatech.edu/~turk/my_papers/schange.pdf" rel="nofollow">http://www.cc.gatech.edu/~turk/my_papers/schange.pdf</a></p>
<p>This uses the same idea that you outline, except instead of taking the convex hull they create a 'best fit' shape in the ambient space using radial basis functions. In this way they don't need the shapes to be isotopic or even homeomorphic.</p>
<p>Maybe people familiar with cobordism would be able to provide insight into what might be desired? Anyway, I like the O'Brien-Turk solution.</p>
http://mathoverflow.net/questions/39617/geodesic-confluence-as-witness-to-a-local-extrinsic-boundGeodesic confluence as witness to a local extrinsic boundRamsay2010-09-22T14:53:18Z2010-09-22T14:53:18Z
<p>This problem seeks a relationship between the lengths of geodesics
which emanate from a point on a surface in $\mathbb{R}^3$ and then
come together again, and the bounds on the lengths of centred normal
fibres through them in a maximal tubular neighbourhood of the surface.</p>
<p>Let $S \subset \mathbb{R}^3$ be a smooth closed (compact without
boundary) surface. The <em>local reach</em> is a function $\rho: S
\rightarrow \mathbb{R}$ such that $\rho(x)$ is the radius of the
smaller of the two maximal empty tangential balls on either side of
$S$ at $x$. An empty tangential ball at $x$ is an open Euclidean ball
in $B \subset \mathbb{R}^3$ that does not intersect $S$, and whose
boundary sphere is tangent to $S$ at $x$. It is maximal if it is not
contained in any other such ball.</p>
<p>Let $\alpha$ and $\gamma$ be two geodesics which emanate from $p \in
S$ in distinct directions and then meet again at $q \in S$.</p>
<blockquote>
<p>I wish to show that there exists some point $z$ on either $\alpha$ or
$\gamma$ such that
$$
\rho(z) \leq \frac{\ell(\alpha) + \ell(\gamma)}{2\pi},
$$
where $\ell(\alpha)$ is the length of $\alpha$.</p>
</blockquote>
<p>If for example $\alpha$ were the shorter geodesic and it contained a
point conjugate to $p$, then our bound would follow from a standard
result that relates the length of $\alpha$ to a bound on the square
root of the sectional curvature it sees (the local reach is bounded by
the radii of the osculating balls).</p>
<p>Also, if $\alpha$ and $\gamma$ together form a geodesic loop, then the
result follows by considering the curvature of that loop as a space
curve ( ... I asked for <a href="http://math.stackexchange.com/questions/4741/a-good-lower-bound-on-the-maximum-curvature-in-a-loop" rel="nofollow" title="math.stackexchange.com">help</a> with that too).</p>
<p>These two observations allow us to show that at least somewhere within
a geodesic disk centred at $p$ and of radius bounded by the
injectivity radius at $p$, we can find a $z$ satisfying the
inequality, but I want more. I want to find such a $z$ on one of these
two arbitrary geodesics.</p>
<p>This question came up within the context of surface sampling, where a
popular means of defining the sampling density is through a function
that is bounded by the local reach. We worked around it, but I'm still
curious, and hope it might provide insight.</p>
http://mathoverflow.net/questions/103053/techniques-for-refining-or-constraining-a-voronoi-diagramComment by RamsayRamsay2012-07-25T07:53:57Z2012-07-25T07:53:57ZIf you have the Voronoi diagram then farthest point sampling (Delaunay refinement) seems like the obvious choice. The farthest point from a station will always be a Voronoi vertex, (or a point where a Voronoi edge intersects your quadrilateral boundary, or a corner of your boundary). Insert a new "station" at that point, and continue until the farthest point is close enough to a station.http://mathoverflow.net/questions/101578/are-properties-of-geodesics-on-a-cylinder-unique-to-cylindersComment by RamsayRamsay2012-07-07T15:03:12Z2012-07-07T15:03:12ZCould we not graft a cylinder (with $z$-axis) to the $xy$-plane (with disk removed) in such a way that no geodesic can self-intersect?http://mathoverflow.net/questions/17551/how-to-show-that-the-bings-house-with-two-rooms-is-contractibleComment by RamsayRamsay2012-04-09T11:13:32Z2012-04-09T11:13:32ZAn update to jc's comment above: Ken Baker made a subsequent post that describes a deformation retraction: <a href="http://sketchesoftopology.wordpress.com/2010/06/23/the-deformation-retraction-of-bings-house/" rel="nofollow">sketchesoftopology.wordpress.com/2010/06/23/…</a>http://mathoverflow.net/questions/15444/the-phenomena-of-eventual-counterexamples/28196#28196Comment by RamsayRamsay2012-02-25T14:19:35Z2012-02-25T14:19:35ZAnother relevant blog post: <a href="http://www.scottaaronson.com/writings/bignumbers.html" rel="nofollow">scottaaronson.com/writings/bignumbers.html</a>http://mathoverflow.net/questions/23439/conic-neighborhoods-polyhedralComment by RamsayRamsay2012-02-02T14:05:37Z2012-02-02T14:05:37ZI guess in the definition of a cone you meant to say that $r\alpha$ is the distance from $\xi$ to $\zeta$ in $\Sigma$?http://mathoverflow.net/questions/77760/why-is-the-half-torus-rigidComment by RamsayRamsay2011-11-02T19:07:11Z2011-11-02T19:07:11ZThe rigidity of the punctured torus is listed as an open problem (number 13) by Ghomi here: people.math.gatech.edu/~ghomi/Papers/op.pdf . I guess either the list is wrong, or I am missing a distinction between things I don't understand.http://mathoverflow.net/questions/65691/is-there-a-combinatorial-analogue-of-ricci-flowComment by RamsayRamsay2011-05-22T15:45:30Z2011-05-22T15:45:30ZD. Glickenstein has done some work that might interest you,
"Combinatorial Yamabe flow in three dimensions"
<a href="http://arxiv.org/abs/math/0506182" rel="nofollow">arxiv.org/abs/math/0506182</a>http://mathoverflow.net/questions/45951/sexy-vacuityComment by RamsayRamsay2011-05-05T11:41:55Z2011-05-05T11:41:55Zde Boor's "An empty exercise" on vacuity in linear algebra: <a href="http://ftp.cs.wisc.edu/Approx/empty.pdf" rel="nofollow">ftp.cs.wisc.edu/Approx/empty.pdf</a> or here:
<a href="http://dx.doi.org/10.1145%2F122272.122273" rel="nofollow">dx.doi.org/10.1145%2F122272.122273</a>http://mathoverflow.net/questions/45951/sexy-vacuity/46009#46009Comment by RamsayRamsay2011-05-05T11:38:33Z2011-05-05T11:38:33ZThere is a neat article by de Boor [An empty exercise](<a href="http://ftp.cs.wisc.edu/Approx/empty.pdf" rel="nofollow">ftp.cs.wisc.edu/Approx/empty.pdf</a>)
([doi](<a href="http://dx.doi.org/10.1145%2F122272.122273" rel="nofollow">dx.doi.org/10.1145%2F122272.122273</a>)), where he argues for the inclusion of $0\times n$ and $m \times 0$ matrices in Matlab. He discusses definitions of span and determinant etc. I found this from a link on the Wikipedia page for determinant.http://mathoverflow.net/questions/5353/how-to-respond-to-i-was-never-much-good-at-maths-at-school/5661#5661Comment by RamsayRamsay2011-04-23T13:10:42Z2011-04-23T13:10:42ZA thoughtful answer. There is an arithmetical error on the first page of the short article linked at the end of the post. It is quite amusing in its context, so I am not entirely sure it isn't intentional.http://mathoverflow.net/questions/62692/should-insights-be-secret/62699#62699Comment by RamsayRamsay2011-04-23T10:03:49Z2011-04-23T10:03:49ZI heard this very anecdote for the first time two days ago. Strange coincidence. Even if it is apocryphal, it does provide an amusing caricature of the Bourbaki philosophy.http://mathoverflow.net/questions/61939/conformal-structure-determined-by-principal-curvaturesComment by RamsayRamsay2011-04-17T01:04:41Z2011-04-17T01:04:41ZThis metric is sometimes used in constructing an approximating inscribed polyhedron for the surface. There are some optimality results, e.g. K. Clarkson (2006) "Building triangulations using epsilon nets" and the works of P. M. Gruber cited therin.http://mathoverflow.net/questions/54742/gaussian-curvature-radius/55734#55734Comment by RamsayRamsay2011-02-18T17:04:30Z2011-02-18T17:04:30ZBy smaller I mean that $\rho_K(x) \leq \rho_G(x)$ for all $x$, where $\rho_G$ is the original definition. They agree everywhere except when the curvature is negative and $\rho_G$ provides no bound.
I would be surprised if you found this to be a useful way to capture the geometry of negatively curved surfaces. Since it is purely intrinsic, you will never be able to control triangle normals this way, for example. It is not clear to me what is represented by the bound you're proposing to introduce. I don't recall seeing it anywhere previously. http://mathoverflow.net/questions/52554/hypersurfaces-and-elliptic-points/52573#52573Comment by RamsayRamsay2011-02-18T09:15:52Z2011-02-18T09:15:52ZIn a response to his own question here: <a href="http://mathoverflow.net/questions/31222/c1-isometric-embedding-of-flat-torus-into-mathbbr3" rel="nofollow" title="c1 isometric embedding of flat torus into mathbbr3">mathoverflow.net/questions/31222/…</a> Joseph O'Rourke linked to a paper by Zalgaller: <a href="http://www.springerlink.com/content/hu76g212137g2864/" rel="nofollow" title="c1 isometric embedding of flat torus into mathbbr3">springerlink.com/content/hu76g212137g2864</a> which describes a PL embedding of a flat torus in $R^3$. I am curious to know where that paper sits in the line of successive rediscoveries.http://mathoverflow.net/questions/1973/is-there-a-complex-structure-on-the-6-sphereComment by RamsayRamsay2010-12-07T19:33:19Z2010-12-07T19:33:19ZA topical preprint has been posted on ArXiv (asserting that $S^6$ has a complex structure): <a href="http://front.math.ucdavis.edu/0505.5634" rel="nofollow">front.math.ucdavis.edu/0505.5634</a>