meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 8 months |
| seen | 2 days ago | |
| stats | profile views | 51 |
|
Apr 26 |
comment |
Probability of the sum of n numbers giving the same last d digits Practical application: When the transmitter adds d check digits or b bits of checksum to a message, what is the probability that the receiver will (incorrectly) fail to detect any errors in a random message? |
|
Mar 30 |
revised |
Conventional ordering of faces of regular polyhedron? mention another stackexchange site that may give better answers to a sub-problem. |
|
Mar 25 |
answered | Conventional ordering of faces of regular polyhedron? |
|
Mar 2 |
answered | Finding a quadratic Bézier curve of length $l$ between two points |
|
Mar 2 |
comment |
Find points along a Bézier curve that are equal distance from one another @Kenpachi: The Babylonian method gives you a bunch of "t" values. The x,y coordinates on the curve at any t is given by plugging that t value into the Bezier function B(t). For example, if we want the x coordinate at t=0.1 of a typical cubic Bezier curve with control points P0, P1, P2, P3, we calculate B_x(0.1) = (1-0.1)^3*P0_x + 3*(1-0.1)^2*(0.1)*P1_x + 3*(1-0.1)*(0.1)^2*P2_x + (0.1)^3*P3_x. |
|
Feb 28 |
answered | Find points along a Bézier curve that are equal distance from one another |
|
Feb 16 |
answered | Changing a bezier curve by dragging a point on the curve itself rather than a control point |
|
Feb 16 |
answered | Detect “Kinks” in Parallel Lines to Bezier Curves [x-post] |
|
Feb 13 |
comment |
How do I find a Bezier curve that goes through a series of points? The design guys are not the problem. The problem is that nearly every 3D CAD package stores curves in its own proprietary binary 3D file format. They are happy to "export" their designs to some other format, but apparently their only choices are (a) some other proprietary binary file format, or (b) a STL made of thousands of tiny flat triangle facets. |
|
Feb 13 |
asked | How do I find a Bezier curve that goes through a series of points? |
|
Feb 13 |
answered | How do I reliably find this point of a sector, regardless of the arc angle? |
|
Feb 12 |
answered | Finding the mid-point of a B-spline curve. |
|
Jan 21 |
answered | fitting two parallel lines to two clusters of points |
|
Jan 21 |
asked | insphere/circumsphere ratio of a polyhedron the same as its dual polyhedron? |
|
Jan 21 |
comment |
Conventional ordering of faces of regular polyhedron? You may be interested in "What is the best way to pixelize a sphere?" by Max Tegmark -- see Wikipedia: quadrilateralized spherical cube and Wikipedia: geodesic grid. |
|
Dec 8 |
answered | Universal Hashing |
|
Sep 3 |
awarded | Yearling |
|
Aug 21 |
comment |
Can prefix code always achieve optimal data compression? @MJD: I think what he's asking is: Does there exist a character code that gives better compression than any prefix code? A proof that, among all possible prefix codes, Huffman is optimal, doesn't resolve this question one way or the other. |
|
Aug 18 |
awarded | Revival |
|
Jul 19 |
awarded | Organizer |
