The popularity of smart sensors and the Internet of Things (IoT) is growing in various fields and applications. Both collect and transfer data to networks. However, due to limited resources, deploying IoT in real-world applications can be challenging. Most of the algorithmic solutions proposed so far to address these challenges were based on linear interval approximations and were developed for resource-constrained microcontroller architectures, i.e., they need buffering of the sensor data and either have a runtime dependency on the segment length or require the sensor inverse response to be analytically known in advance. Our present work proposed a new algorithm for the piecewise-linear approximation of differentiable sensor characteristics with varying algebraic curvature, maintaining the low fixed computational complexity as well as reduced memory requirements, as demonstrated in a test concerning the linearization of the inverse sensor characteristic of type K thermocouple. As before, our error-minimization approach solved the two problems of finding the inverse sensor characteristic and its linearization simultaneously while minimizing the number of points needed to support the characteristic.