Quadratic Bezier from Power Coefficients

Description

Convert planar ascending power coefficients to Bezier control points for explicit degree 2; exact linear basis change under finite arithmetic.

A planar Bézier curve is defined by an ordered control polygon: three points for a quadratic or four for a cubic. Its parameter t runs from 0 to 1 and generally does not measure arc length. Derivative vectors, curve positions, control points and polynomial coefficients are different representations of the same parameterized geometry.

Convert planar ascending power coefficients to Bezier control points for explicit degree 2; exact linear basis change under finite arithmetic.

When to use this tool

Use this tool to convert planar ascending power coefficients to Bezier control points for explicit degree 2; exact linear basis change under finite arithmetic.

How to use the tool and how it works

Enter points using the input definitions below.
Run the operation. Resolve malformed-input errors before interpreting the result.
Read result.points. Interpret signs, units, ordering and null values using the rules below.

Read 3 [x,y] coefficient pairs in ascending powers t⁰ through t^2. Recover control P[i] = sum from k=0 to i of C(i,k)/C(2,k) times coefficient[k], independently for x and y.^[1]

Input field	Meaning and units	Accepted input
points	Ascending [x,y] power-coefficient pairs: constant first, through t² for quadratic or t³ for cubic. These are coefficients, not geometric sample points.	Dense list of at most 128 rows of at most 128 finite numbers; the operation’s shape constraints also apply.

Output field	Interpretation
result	Object containing the fields below.
result.points	Resulting ordered planar Bézier control polygon.

json

{
  "input": {
    "points": [
      [
        0,
        0
      ],
      [
        2,
        2
      ],
      [
        0,
        -2
      ]
    ]
  },
  "output": {
    "result": {
      "points": [
        [
          0,
          0
        ],
        [
          1,
          1
        ],
        [
          2,
          0
        ]
      ]
    }
  }
}

Limitations and assumptions

The points input contains power coefficients, not sample points. This fixed-degree linear basis change uses floating arithmetic without fitting.
Each geometric control point has two finite coordinates within ±1,000,000,000. t and interval endpoints are dimensionless in [0,1]. Calculations use floating arithmetic and do not perform curve fitting or robust topology analysis.
Every declared top-level input is required and unknown fields are rejected. Ordinary strings are limited to 8,192 UTF-16 code units and lists to 128 entries, with tighter operation-specific bounds where stated. JSON text has bounded nesting and node counts.
Numeric outputs must be finite and within the absolute safe-integer magnitude; exact larger integers use decimal text. Source positions are zero-based UTF-16 offsets and span ends are exclusive unless a different convention is explicitly stated.

Alternative or Complementary methods

Keep control polygons and constant-first power coefficients clearly labeled. Use separate arc-length integration or adaptive sampling when physical spacing or geometric approximation error matters.

References

Tool behavior and example: Quadratic Bezier from Power Coefficients — tool.io

Similar or alternative tools

Quadratic Bezier Power Coefficients
Convert planar Bezier control points to ascending power coefficients for explicit degree 2; exact linear basis change under finite arithmetic.
Cubic Bezier from Power Coefficients
Convert planar ascending power coefficients to Bezier control points for explicit degree 3; exact linear basis change under finite arithmetic.