elliptical-arc.h revision 037c4c3708e40a1f7569b4ea176380958fd1389a
321N/A/*
321N/A * Elliptical Arc - implementation of the svg elliptical arc path element
1356N/A *
321N/A * Authors:
1356N/A * MenTaLguY <mental@rydia.net>
321N/A * Marco Cecchetti <mrcekets at gmail.com>
321N/A *
919N/A * Copyright 2007-2008 authors
919N/A *
919N/A * This library is free software; you can redistribute it and/or
919N/A * modify it either under the terms of the GNU Lesser General Public
919N/A * License version 2.1 as published by the Free Software Foundation
919N/A * (the "LGPL") or, at your option, under the terms of the Mozilla
919N/A * Public License Version 1.1 (the "MPL"). If you do not alter this
919N/A * notice, a recipient may use your version of this file under either
919N/A * the MPL or the LGPL.
919N/A *
919N/A * You should have received a copy of the LGPL along with this library
919N/A * in the file COPYING-LGPL-2.1; if not, write to the Free Software
919N/A * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
919N/A * You should have received a copy of the MPL along with this library
919N/A * in the file COPYING-MPL-1.1
919N/A *
919N/A * The contents of this file are subject to the Mozilla Public License
321N/A * Version 1.1 (the "License"); you may not use this file except in
321N/A * compliance with the License. You may obtain a copy of the License at
321N/A * http://www.mozilla.org/MPL/
321N/A *
493N/A * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY
321N/A * OF ANY KIND, either express or implied. See the LGPL or the MPL for
970N/A * the specific language governing rights and limitations.
977N/A */
970N/A
1356N/A
970N/A
321N/A
1408N/A#ifndef _2GEOM_ELLIPTICAL_ARC_H_
321N/A#define _2GEOM_ELLIPTICAL_ARC_H_
911N/A
1408N/A
1408N/A#include "curve.h"
1408N/A#include "angle.h"
911N/A#include "utils.h"
321N/A#include "sbasis-curve.h" // for non-native methods
321N/A
321N/A#include <algorithm>
321N/A
1408N/A
493N/Anamespace Geom
321N/A{
970N/A
970N/Aclass EllipticalArc : public Curve
970N/A{
321N/A public:
EllipticalArc()
: m_initial_point(Point(0,0)), m_final_point(Point(0,0)),
m_rx(0), m_ry(0), m_rot_angle(0),
m_large_arc(true), m_sweep(true)
{
m_start_angle = m_end_angle = 0;
m_center = Point(0,0);
}
EllipticalArc( Point _initial_point, double _rx, double _ry,
double _rot_angle, bool _large_arc, bool _sweep,
Point _final_point
)
: m_initial_point(_initial_point), m_final_point(_final_point),
m_rx(_rx), m_ry(_ry), m_rot_angle(_rot_angle),
m_large_arc(_large_arc), m_sweep(_sweep)
{
calculate_center_and_extreme_angles();
}
void set( Point _initial_point, double _rx, double _ry,
double _rot_angle, bool _large_arc, bool _sweep,
Point _final_point
)
{
m_initial_point = _initial_point;
m_final_point = _final_point;
m_rx = _rx;
m_ry = _ry;
m_rot_angle = _rot_angle;
m_large_arc = _large_arc;
m_sweep = _sweep;
calculate_center_and_extreme_angles();
}
Curve* duplicate() const
{
return new EllipticalArc(*this);
}
double center(unsigned int i) const
{
return m_center[i];
}
Point center() const
{
return m_center;
}
Point initialPoint() const
{
return m_initial_point;
}
Point finalPoint() const
{
return m_final_point;
}
double start_angle() const
{
return m_start_angle;
}
double end_angle() const
{
return m_end_angle;
}
double ray(unsigned int i) const
{
return (i == 0) ? m_rx : m_ry;
}
bool large_arc_flag() const
{
return m_large_arc;
}
bool sweep_flag() const
{
return m_sweep;
}
double rotation_angle() const
{
return m_rot_angle;
}
void setInitial( const Point _point)
{
m_initial_point = _point;
calculate_center_and_extreme_angles();
}
void setFinal( const Point _point)
{
m_final_point = _point;
calculate_center_and_extreme_angles();
}
void setExtremes( const Point& _initial_point, const Point& _final_point )
{
m_initial_point = _initial_point;
m_final_point = _final_point;
calculate_center_and_extreme_angles();
}
bool isDegenerate() const
{
return ( are_near(ray(X), 0) || are_near(ray(Y), 0) );
}
Rect boundsFast() const
{
return boundsExact();
}
Rect boundsExact() const;
// TODO: native implementation of the following methods
Rect boundsLocal(Interval i, unsigned int deg) const
{
return SBasisCurve(toSBasis()).boundsLocal(i, deg);
}
std::vector<double> roots(double v, Dim2 d) const;
std::vector<double>
allNearestPoints( Point const& p, double from = 0, double to = 1 ) const;
double nearestPoint( Point const& p, double from = 0, double to = 1 ) const
{
if ( are_near(ray(X), ray(Y)) && are_near(center(), p) )
{
return from;
}
return allNearestPoints(p, from, to).front();
}
// TODO: native implementation of the following methods
int winding(Point p) const
{
return SBasisCurve(toSBasis()).winding(p);
}
Curve *derivative() const;
// TODO: native implementation of the following methods
Curve *transformed(Matrix const &m) const
{
return SBasisCurve(toSBasis()).transformed(m);
}
std::vector<Point> pointAndDerivatives(Coord t, unsigned int n) const;
D2<SBasis> toSBasis() const;
bool containsAngle(Coord angle) const;
double valueAtAngle(Coord t, Dim2 d) const;
Point pointAtAngle(Coord t) const
{
double sin_rot_angle = std::sin(rotation_angle());
double cos_rot_angle = std::cos(rotation_angle());
Matrix m( ray(X) * cos_rot_angle, ray(X) * sin_rot_angle,
-ray(Y) * sin_rot_angle, ray(Y) * cos_rot_angle,
center(X), center(Y) );
Point p( std::cos(t), std::sin(t) );
return p * m;
}
double valueAt(Coord t, Dim2 d) const
{
Coord tt = map_to_02PI(t);
return valueAtAngle(tt, d);
}
Point pointAt(Coord t) const
{
Coord tt = map_to_02PI(t);
return pointAtAngle(tt);
}
std::pair<EllipticalArc, EllipticalArc>
subdivide(Coord t) const
{
EllipticalArc* arc1 = static_cast<EllipticalArc*>(portion(0, t));
EllipticalArc* arc2 = static_cast<EllipticalArc*>(portion(t, 1));
assert( arc1 != NULL && arc2 != NULL);
std::pair<EllipticalArc, EllipticalArc> arc_pair(*arc1, *arc2);
delete arc1;
delete arc2;
return arc_pair;
}
Curve* portion(double f, double t) const;
// the arc is the same but traversed in the opposite direction
Curve* reverse() const
{
EllipticalArc* rarc = new EllipticalArc( *this );
rarc->m_sweep = !m_sweep;
rarc->m_initial_point = m_final_point;
rarc->m_final_point = m_initial_point;
rarc->m_start_angle = m_end_angle;
rarc->m_end_angle = m_start_angle;
return rarc;
}
double sweep_angle() const
{
Coord d = end_angle() - start_angle();
if ( !sweep_flag() ) d = -d;
if ( d < 0 )
d += 2*M_PI;
return d;
}
private:
Coord map_to_02PI(Coord t) const;
Coord map_to_01(Coord angle) const;
void calculate_center_and_extreme_angles();
private:
Point m_initial_point, m_final_point;
double m_rx, m_ry, m_rot_angle;
bool m_large_arc, m_sweep;
double m_start_angle, m_end_angle;
Point m_center;
}; // end class EllipticalArc
} // end namespace Geom
#endif // _2GEOM_ELLIPTICAL_ARC_H_
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:encoding=utf-8:textwidth=99 :