Bilinear interpolation
API · /interpolation-api
Interpolation API
Interpolation maths as an API, computed locally and deterministically. The linear endpoint interpolates between two points, y = y0 + (y1 − y0)·(x − x0)/(x1 − x0), returning the value at a target x (or, given a target y, solving the x that produces it), the parameter t and whether the point lies outside the segment. The table endpoint does piecewise-linear interpolation within a table of (x, y) points supplied as comma-separated lists — it sorts the points, finds the two that bracket your query and interpolates between them, extending the nearest segment and flagging the result when you query outside the data range, ideal for calibration curves and lookup tables. The bilinear endpoint interpolates on a rectangular grid from four corner values, interpolating along x at each y-edge and then along y. Everything is computed locally and deterministically, so it is instant and private, and unlike regression it passes exactly through the supplied points. Ideal for engineering, data-visualisation, gaming, mapping and scientific-computing app developers, lookup-table and calibration tools, and numerical-methods education. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is interpolation; for least-squares regression and correlation use a statistics API.
API health
healthy- Uptime
- 100.00%
- Server probes · 24h
- Avg latency
- 92 ms
- Server probes · 24h
- Subscribers
- 3,134
- active
- Total calls
- 28
- last 7 days
Pricing
Pick a tier — billed monthly, cancel anytime.
Free
Free
- 3,000 calls / month
- 2 requests / second
- Hard cap (429 above quota, no overage)
- Linear interpolation between two points
- JSON request/response
- Deterministic, instant results
- Community support
Starter
€5.00 /month
- 40,000 calls / month
- 5 requests / second
- Hard cap (429 above quota, no overage)
- Linear + nearest-neighbour lookup
- Batch up to 50 points per call
- Input validation with clear errors
- Email support
Pro
€15.00 /month
- 300,000 calls / month
- 20 requests / second
- Hard cap (429 above quota, no overage)
- Lookup-table interpolation
- Bulk arrays per request
- Clamp + extrapolation controls
- Priority support
Mega
€45.00 /month
- 2,000,000 calls / month
- 60 requests / second
- Hard cap (429 above quota, no overage)
- All interpolation modes at full throughput
- High-volume batch endpoints
- Highest rate limits for production pipelines
- SLA-backed uptime
Built by
Related APIs
Other APIs with overlapping tags.
Range Remap API
Map numbers between ranges. The scale endpoint linearly maps a value from an input range [in_min, in_max] onto an output range [out_min, out_max] — the classic map() you reach for with sensor readings, sliders and knobs, gauges and progress bars, and data-visualisation axes. It also returns the 0–1 position t, so with the default 0–1 output range it normalizes a value, and with a 0–1 input range it interpolates (lerp); output ranges may be reversed (out_min greater than out_max) to invert direction, and an optional clamp keeps the result inside the output range instead of extrapolating. The clamp endpoint constrains a value to a minimum and maximum and can additionally snap it to the nearest step. Everything is exact local maths, instant and deterministic. Ideal for IoT and embedded (Arduino-style map), audio and DSP, graphics and game development, dashboards and charts, and UI controls. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This maps scalar values — for interpolating vectors use a vector API and for animation easing curves use an easing API.
api.oanor.com/remap-api
Combinatorics API
Combinatorics maths as an API, computed locally and deterministically with exact arbitrary-precision integers. The factorial endpoint computes n! = 1·2·3···n (with 0! = 1) and returns it exactly as a string together with its digit count, so even very large factorials stay precise. The permutations endpoint counts ordered arrangements: without repetition nPr = n!/(n−r)! arrangements of r items chosen from n, and with repetition n^r, where each of the r positions may be any of the n items. The combinations endpoint counts unordered selections: without repetition the binomial coefficient nCr = n!/(r!·(n−r)!), and with repetition (multisets) C(n+r−1, r), where repeats are allowed. All results are computed with BigInt so they are exact no matter how large, returned as a string with the number of digits and a floating-point approximation when it fits. n and r are non-negative integers up to 100000. Everything is computed locally and deterministically, so it is instant and private. Ideal for probability, statistics, lottery, game-design, cryptography and education app developers, counting and odds tools, and discrete-maths teaching. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is counting combinatorics; for modular arithmetic use a modular API and for descriptive statistics a statistics API.
api.oanor.com/combinatorics-api
Modular Arithmetic API
Modular-arithmetic maths as an API, computed locally and deterministically with exact big-integer arithmetic. The power endpoint computes modular exponentiation, aᵇ mod m, by square-and-multiply, fast and exact even for the huge exponents used in cryptography. The inverse endpoint finds the modular multiplicative inverse a⁻¹ mod m with the extended Euclidean algorithm, returning the inverse when a and m are coprime and reporting the gcd when no inverse exists. The totient endpoint computes Euler's totient φ(n) — the count of integers from 1 to n coprime to n — with the prime factorization it comes from, and an optional Euler-theorem check that a^φ(n) ≡ 1 (mod n) for a coprime base. These are the building blocks of RSA and much of modern cryptography. Inputs are integers and can be passed as strings for very large values. Everything is computed locally and deterministically, so it is instant and private. Ideal for cryptography, security, blockchain and mathematics app developers, RSA and number-theory tools, and computer-science education. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is modular arithmetic; for prime factorization and GCD use a number-theory API and for integer sequences a sequences API.
api.oanor.com/modular-api
Complex Number API
Complex-number maths as an API, computed locally and deterministically. The arithmetic endpoint adds, subtracts, multiplies or divides two complex numbers z₁ = a + bi and z₂ = c + di, returning the result in both rectangular (a + bi) and polar (modulus ∠ angle) form. The properties endpoint describes a single complex number — its modulus |z| = √(a² + b²), its argument in radians and degrees, its conjugate, its negation, its reciprocal and its polar form. The power endpoint applies De Moivre's theorem, zⁿ = rⁿ(cos nθ + i·sin nθ), to raise a complex number to any real power, and for a positive integer n it also returns all n distinct n-th roots, evenly spaced around the complex plane. The imaginary part defaults to zero, so real inputs work too. Everything is computed locally and deterministically, so it is instant and private. Ideal for engineering, signal-processing, electronics, physics and mathematics app developers, AC-circuit and phasor tools, and STEM education. Pure local computation — no key, no third-party service, instant. Live, nothing stored. 3 endpoints. This is complex-number arithmetic; for plane-angle unit conversion use an angle API and for vectors a vector API.
api.oanor.com/complexnumber-api
Frequently asked questions
Quick answers about pricing, quotas, and integration.
How do I get an API key for Interpolation API?
What's the rate limit for Interpolation API?
How much does Interpolation API cost?
Can I cancel my subscription anytime?
Is Interpolation API GDPR-compliant?
Pick an endpoint from the list on the left to see its details and try it.
Code snippets
Sign up to get an API key, then call any path under your slug.
curl https://api.oanor.com/interpolation-api/SOME_PATH \
-H "x-oanor-key: oanor_test_..."
const res = await fetch("https://api.oanor.com/interpolation-api/SOME_PATH", {
headers: { "x-oanor-key": "oanor_test_..." }
});
const data = await res.json();
$ch = curl_init("https://api.oanor.com/interpolation-api/SOME_PATH");
curl_setopt($ch, CURLOPT_RETURNTRANSFER, true);
curl_setopt($ch, CURLOPT_HTTPHEADER, ["x-oanor-key: oanor_test_..."]);
$response = curl_exec($ch);
import requests
r = requests.get(
"https://api.oanor.com/interpolation-api/SOME_PATH",
headers={"x-oanor-key": "oanor_test_..."},
)
print(r.json())
Ratings
Sign in to rate.
No reviews yet.
Discussion
Ask questions, share usage tips, get answers from the provider and other developers. Public — anyone can read.
Sign in to start a thread or reply.
Sign inNew thread
·
-
Provider answer
🔒 This thread is locked — no new replies.
-
·
- No threads yet — start the discussion.
Support
Private 1:1 support with the provider — billing questions, integration issues, account problems. Only you and the provider team can see these threads.
Sign in to open a support ticket.
Sign inOpen new ticket
Describe what you need help with. The provider team gets an email and replies on the ticket page.
-
·
Urgent - No tickets yet for this API.