libcruft-util/bezier.hpp

60 lines
1.6 KiB
C++
Raw Normal View History

2015-01-21 23:42:45 +11:00
/*
2015-04-13 18:05:28 +10:00
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
2015-01-21 23:42:45 +11:00
*
2015-04-13 18:05:28 +10:00
* http://www.apache.org/licenses/LICENSE-2.0
2015-01-21 23:42:45 +11:00
*
2015-04-13 18:05:28 +10:00
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
2015-01-21 23:42:45 +11:00
*
* Copyright 2015 Danny Robson <danny@nerdcruft.net>
*/
#ifndef __UTIL_BEZIER_HPP
#define __UTIL_BEZIER_HPP
#include "point.hpp"
2015-02-03 12:53:41 +11:00
#include "region.hpp"
2015-01-21 23:42:45 +11:00
2015-01-22 14:56:19 +11:00
#include <iostream>
2015-01-21 23:42:45 +11:00
namespace util {
template <size_t S>
class bezier {
2015-01-22 14:54:32 +11:00
public:
bezier (const util::point2f (&)[S+1]);
2015-01-21 23:42:45 +11:00
2015-01-22 14:54:32 +11:00
point2f eval (float t) const;
2015-01-29 15:47:40 +11:00
// Calculate the expanded polynomial coeffecients in terms of t
std::array<vector2f,S+1>
coeffs (void) const;
size_t intersections (point2f from, point2f to) const;
2015-01-22 14:54:32 +11:00
float distance (point2f) const;
2015-01-21 23:42:45 +11:00
2015-02-03 12:53:41 +11:00
region2f region (void) const;
2015-01-21 23:42:45 +11:00
point2f& operator[] (size_t idx);
const point2f& operator[] (size_t idx) const;
private:
// HACK: allow easy access to component-wise arithmetic using
// vector2f rather than point2f in the implementation.
union {
point2f m_points[S+1];
vector2f m_coeffs[S+1];
};
2015-01-21 23:42:45 +11:00
};
2015-01-22 14:56:19 +11:00
template <size_t S>
std::ostream& operator<< (std::ostream&, const bezier<S>&);
2015-01-21 23:42:45 +11:00
}
#endif