A Survey of De Casteljau Algorithms and Regular Iterative Constructions of Bézier Curves with Control Mass Points
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Drawing a curve on a computer actually involves approximating it by a set of segments. The De Casteljau algorithm allows to construct these piecewise linear curves which approximate polynomial Bézier curves using convex combinations. However, for rational Bézier curves, the construction no longer admits regular sampling. To solve this problem, we propose a generalization of the De Casteljau algorithm that addresses this issue and is applicable to Bézier curves with mass points (a weighted point or a vector) as control points and using a homographic parameter change dividing the interval [0, 1] into two equal-length intervals [0, 1/2] and [1/2 , 1] . If the initial Bézier curve is in standard form, we obtain two curves in standard form, unless the mass endpoint of the curve is a vector. This homographic parameter change also allows transforming curves defined over an interval [α, +∞], α ∈ R, into Bézier curves, which then enables the use of the De Casteljau algorithm. Some examples are given: three-quart of circle, semicircle and a branch of a hyperbola (degree 2), cubic curve on [0; +∞] and loop of a Descartes Folium (degree 3) and a loop of a Bernouilli Lemniscate (degree 4).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it