Reputation
992
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
12 19
Newest
 Necromancer
Impact
~173k people reached

Mar
25
awarded  Necromancer
Feb
4
comment Paralel bezier curve
I found another reference which mentions this: the very old (2003) comp.graphics.algorithms FAQ at faqs.org/faqs/graphics/algorithms-faq says in question 4.01: "How do I generate a Bezier curve that is parallel to another Bezier? You can't. The only case where this is possible is when the Bezier can be represented by a straight line. And then the parallel 'Bezier' can also be represented by a straight line."
Oct
3
awarded  Necromancer
Jun
28
comment Awfully sophisticated proof for simple facts
@MichaelBlackmon: Do you have a reference for that claim? This would give me a proof of the corollary that I'm an algebraist.
Jun
26
awarded  Announcer
Jun
24
comment What introductory book on Graph Theory would you recommend?
See also a more specific question with this answer: mathoverflow.net/a/95565/5340
Jun
24
comment Demonstrating that rigour is important
I guess this was in the 20th century. These days you can check quickly with a computer that the sum of the first five million primes is already over pi.
Jun
24
comment Demonstrating that rigour is important
@BlueRaja: yes, but the calculator will be dead long before that point happens.
Jun
24
revised Large bicliques in r-partite graphs containing no independent sets having one vertex from each class
add ramsey-theory tag
Jun
24
suggested approved edit on Large bicliques in r-partite graphs containing no independent sets having one vertex from each class
Apr
27
revised Computionally efficient vertex enumeration for (convex) polytopes
add tag [computational-geometry]
Apr
27
suggested approved edit on Computionally efficient vertex enumeration for (convex) polytopes
Apr
27
comment Computionally efficient vertex enumeration for (convex) polytopes
How is the polytope defined? Is it given as an intersection of half-planes? If so, can this problem be transformed to the dual problem of enumerating all the facets of the convex hull if the vertices are given?
Apr
24
comment Minimum number of real multiplications to multiply two quaternions
Also cross-posted to Theoretical Computer Science: cstheory.stackexchange.com/q/31251/8067
Apr
14
answered What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs?
Apr
14
comment Open problems in Euclidean geometry?
This has also been asked as a question on our site: mathoverflow.net/q/20558/5340 What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs?
Apr
14
answered Open problems in Euclidean geometry?
Apr
13
awarded  Yearling
Apr
13
answered Is every graph an edge-crossing graph?
Mar
21
comment Mathematical habits of thought and action which would be of use to non-mathematicians
So as a mathematician, I should be paid more if I get fatter? See the recent Dilbert strips: dilbert.com/series/63