curve.cpp revision 235e8e7977f17c6070b4691837b8a6cb2bd4cc35
#define __CURVE_C__
/** \file
* Routines for SPCurve and for its Geom::PathVector
*/
/*
* Authors:
* Lauris Kaplinski <lauris@kaplinski.com>
* Johan Engelen
*
* Copyright (C) 2000 Lauris Kaplinski
* Copyright (C) 2000-2001 Ximian, Inc.
* Copyright (C) 2002 Lauris Kaplinski
* Copyright (C) 2008 Johan Engelen
*
* Released under GNU GPL
*/
#include "display/curve.h"
#include <glib/gmessages.h>
#include <2geom/pathvector.h>
#include <2geom/sbasis-geometric.h>
#include <2geom/sbasis-to-bezier.h>
#include <2geom/point.h>
/* Constructors */
/**
* The returned curve's state is as if SPCurve::reset has just been called on it.
*/
SPCurve::SPCurve()
: _refcount(1),
_pathv()
{
_pathv.clear();
}
SPCurve::SPCurve(Geom::PathVector const& pathv)
: _refcount(1),
_pathv(pathv)
{
}
SPCurve *
SPCurve::new_from_rect(Geom::Rect const &rect)
{
SPCurve *c = new SPCurve();
Geom::Point p = rect.corner(0);
c->moveto(p);
for (int i=3; i>=0; i--) {
c->lineto(rect.corner(i));
}
c->closepath_current();
return c;
}
SPCurve::~SPCurve()
{
}
/* Methods */
void
SPCurve::set_pathvector(Geom::PathVector const & new_pathv)
{
_pathv = new_pathv;
}
Geom::PathVector const &
SPCurve::get_pathvector() const
{
return _pathv;
}
/*
* Returns the number of segments of all paths summed
* This count includes the closing line segment of a closed path.
*/
guint
SPCurve::get_segment_count() const
{
guint nr = 0;
for(Geom::PathVector::const_iterator it = _pathv.begin(); it != _pathv.end(); ++it) {
nr += (*it).size();
if (it->closed()) nr += 1;
}
return nr;
}
/**
* Increase _refcount of curve.
*
* \todo should this be shared with other refcounting code?
*/
SPCurve *
SPCurve::ref()
{
_refcount += 1;
return this;
}
/**
* Decrease refcount of curve, with possible destruction.
*
* \todo should this be shared with other refcounting code?
*/
SPCurve *
SPCurve::unref()
{
_refcount -= 1;
if (_refcount < 1) {
delete this;
}
return NULL;
}
/**
* Create new curve from this curve's pathvector array.
*/
SPCurve *
SPCurve::copy() const
{
return new SPCurve(_pathv);
}
/**
* Return new curve that is the concatenation of all curves in list.
*/
SPCurve *
SPCurve::concat(GSList const *list)
{
SPCurve *new_curve = new SPCurve();
for (GSList const *l = list; l != NULL; l = l->next) {
SPCurve *c = (SPCurve *) l->data;
new_curve->_pathv.insert( new_curve->_pathv.end(), c->get_pathvector().begin(), c->get_pathvector().end() );
}
return new_curve;
}
/**
* Returns a list of new curves corresponding to the subpaths in \a curve.
* 2geomified
*/
GSList *
SPCurve::split() const
{
GSList *l = NULL;
for (Geom::PathVector::const_iterator path_it = _pathv.begin(); path_it != _pathv.end(); ++path_it) {
Geom::PathVector newpathv;
newpathv.push_back(*path_it);
SPCurve * newcurve = new SPCurve(newpathv);
l = g_slist_prepend(l, newcurve);
}
return l;
}
/**
* Transform all paths in curve using matrix.
*/
void
SPCurve::transform(Geom::Matrix const &m)
{
_pathv *= m;
}
/**
* Set curve to empty curve.
* In more detail: this clears the internal pathvector from all its paths.
*/
void
SPCurve::reset()
{
_pathv.clear();
}
/** Several consecutive movetos are ALLOWED
* Ref: http://www.w3.org/TR/SVG11/implnote.html#PathElementImplementationNotes
* (first subitem of the item about zero-length path segments) */
/**
* Calls SPCurve::moveto() with point made of given coordinates.
*/
void
SPCurve::moveto(gdouble x, gdouble y)
{
moveto(Geom::Point(x, y));
}
/**
* Perform a moveto to a point, thus starting a new subpath.
*/
void
SPCurve::moveto(Geom::Point const &p)
{
_pathv.push_back( Geom::Path() ); // for some reason Geom::Path(p) does not work...
_pathv.back().start(p);
}
/**
* Calls SPCurve::lineto() with a point's coordinates.
*/
void
SPCurve::lineto(Geom::Point const &p)
{
lineto(p[Geom::X], p[Geom::Y]);
}
/**
* Adds a line to the current subpath.
*/
void
SPCurve::lineto(gdouble x, gdouble y)
{
if (_pathv.empty()) g_message("leeg");
else _pathv.back().appendNew<Geom::LineSegment>( Geom::Point(x,y) );
}
/**
* Calls SPCurve::curveto() with coordinates of three points.
*/
void
SPCurve::curveto(Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2)
{
using Geom::X;
using Geom::Y;
curveto( p0[X], p0[Y],
p1[X], p1[Y],
p2[X], p2[Y] );
}
/**
* Adds a bezier segment to the current subpath.
*/
void
SPCurve::curveto(gdouble x0, gdouble y0, gdouble x1, gdouble y1, gdouble x2, gdouble y2)
{
if (_pathv.empty()) g_message("leeg");
else _pathv.back().appendNew<Geom::CubicBezier>( Geom::Point(x0,y0), Geom::Point(x1,y1), Geom::Point(x2,y2) );
}
/**
* Close current subpath by possibly adding a line between start and end.
*/
void
SPCurve::closepath()
{
_pathv.back().close(true);
}
/** Like SPCurve::closepath() but sets the end point of the last subpath
to the subpath start point instead of adding a new lineto.
Used for freehand drawing when the user draws back to the start point.
**/
void
SPCurve::closepath_current()
{
_pathv.back().setFinal(_pathv.back().initialPoint());
_pathv.back().close(true);
}
/**
* True if no paths are in curve. If it only contains a path with only a moveto, the path is considered NON-empty
*/
bool
SPCurve::is_empty() const
{
return _pathv.empty();
}
/**
* True iff all subpaths are closed.
* Returns false if the curve is empty.
*/
bool
SPCurve::is_closed() const
{
if (is_empty()) {
return false;
} else {
bool closed = true;
for (Geom::PathVector::const_iterator it = _pathv.begin(); it != _pathv.end(); it++) {
if ( ! it->closed() ) {
closed = false;
break;
}
}
return closed;
}
}
/**
* Return last pathsegment (possibly the closing path segment) of the last path in PathVector or NULL.
* If the last path is empty (contains only a moveto), the function returns NULL
*/
Geom::Curve const *
SPCurve::last_segment() const
{
if (is_empty()) {
return NULL;
}
if (_pathv.back().empty()) {
return NULL;
}
return &_pathv.back().back_default();
}
/**
* Return last path in PathVector or NULL.
*/
Geom::Path const *
SPCurve::last_path() const
{
if (is_empty()) {
return NULL;
}
return &_pathv.back();
}
/**
* Return first pathsegment in PathVector or NULL.
* equal in functionality to SPCurve::first_bpath()
*/
Geom::Curve const *
SPCurve::first_segment() const
{
if (is_empty()) {
return NULL;
}
if (_pathv.front().empty()) {
return NULL;
}
return &_pathv.front().front();
}
/**
* Return first path in PathVector or NULL.
*/
Geom::Path const *
SPCurve::first_path() const
{
if (is_empty()) {
return NULL;
}
return &_pathv.front();
}
/**
* Return first point of first subpath or (0,0). TODO: shouldn't this be (NR_HUGE, NR_HUGE) to be able to tell it apart from normal (0,0) ?
*/
Geom::Point
SPCurve::first_point() const
{
if (is_empty())
return Geom::Point(0, 0);
return _pathv.front().initialPoint();
}
/**
* Return the second point of first subpath or _movePos if curve too short.
* If the pathvector is empty, this returns (0,0). If the first path is only a moveto, this method
* returns the first point of the second path, if it exists. If there is no 2nd path, it returns the
* first point of the first path.
*
* FIXME: for empty paths shouldn't this return (NR_HUGE,NR_HUGE)
*/
Geom::Point
SPCurve::second_point() const
{
if (is_empty()) {
return Geom::Point(0,0);
}
else if (_pathv.front().empty()) {
// first path is only a moveto
// check if there is second path
if (_pathv.size() > 1) {
return _pathv[1].initialPoint();
} else {
return _pathv[0].initialPoint();
}
}
else
return _pathv.front()[0].finalPoint();
}
/**
* TODO: fix comment: Return the second-last point of last subpath or _movePos if curve too short.
*/
Geom::Point
SPCurve::penultimate_point() const
{
Geom::Curve const& back = _pathv.back().back_default();
return back.initialPoint();
}
/**
* Return last point of last subpath or (0,0). TODO: shouldn't this be (NR_HUGE, NR_HUGE) to be able to tell it apart from normal (0,0) ?
* If the last path is only a moveto, then return that point.
*/
Geom::Point
SPCurve::last_point() const
{
if (is_empty())
return Geom::Point(0, 0);
return _pathv.back().finalPoint();
}
/**
* Returns a *new* \a curve but drawn in the opposite direction.
* Should result in the same shape, but
* with all its markers drawn facing the other direction.
* Reverses the order of subpaths as well
**/
SPCurve *
SPCurve::create_reverse() const
{
SPCurve *new_curve = new SPCurve(Geom::reverse_paths_and_order(_pathv));
return new_curve;
}
/**
* Append \a curve2 to \a this.
* If \a use_lineto is false, simply add all paths in \a curve2 to \a this;
* if \a use_lineto is true, combine \a this's last path and \a curve2's first path and add the rest of the paths in \a curve2 to \a this.
*/
void
SPCurve::append(SPCurve const *curve2,
bool use_lineto)
{
if (curve2->is_empty())
return;
if (use_lineto) {
Geom::PathVector::const_iterator it = curve2->_pathv.begin();
if ( ! _pathv.empty() ) {
Geom::Path & lastpath = _pathv.back();
lastpath.appendNew<Geom::LineSegment>( (*it).initialPoint() );
lastpath.append( (*it) );
} else {
_pathv.push_back( (*it) );
}
for (it++; it != curve2->_pathv.end(); it++) {
_pathv.push_back( (*it) );
}
} else {
for (Geom::PathVector::const_iterator it = curve2->_pathv.begin(); it != curve2->_pathv.end(); it++) {
_pathv.push_back( (*it) );
}
}
}
/**
* Append \a c1 to \a this with possible fusing of close endpoints. If the end of this curve and the start of c1 are within tolerance distance,
* then the startpoint of c1 is moved to the end of this curve and the first subpath of c1 is appended to the last subpath of this curve.
* When one of the curves (this curve or the argument curve) is closed, the returned value is NULL; otherwise the returned value is this curve.
* When one of the curves is empty, this curves path becomes the non-empty path.
*/
SPCurve *
SPCurve::append_continuous(SPCurve const *c1, gdouble tolerance)
{
using Geom::X;
using Geom::Y;
g_return_val_if_fail(c1 != NULL, NULL);
if ( this->is_closed() || c1->is_closed() ) {
return NULL;
}
if (c1->is_empty()) {
return this;
}
if (this->is_empty()) {
_pathv = c1->_pathv;
return this;
}
if ( (fabs(this->last_point()[X] - c1->first_point()[X]) <= tolerance)
&& (fabs(this->last_point()[Y] - c1->first_point()[Y]) <= tolerance) )
{
// c1's first subpath can be appended to this curve's last subpath
Geom::PathVector::const_iterator path_it = c1->_pathv.begin();
Geom::Path & lastpath = _pathv.back();
Geom::Path newfirstpath(*path_it);
newfirstpath.setInitial(lastpath.finalPoint());
lastpath.append( newfirstpath );
for (path_it++; path_it != c1->_pathv.end(); path_it++) {
_pathv.push_back( (*path_it) );
}
} else {
append(c1, false);
}
return this;
}
/**
* Remove last segment of curve.
* (Only used once in /src/pen-context.cpp)
*/
void
SPCurve::backspace()
{
if ( is_empty() )
return;
if ( !_pathv.back().empty() ) {
_pathv.back().erase_last();
_pathv.back().close(false);
}
}
/**
* TODO: add comments about what this method does and what assumptions are made and requirements are put on SPCurve
*/
void
SPCurve::stretch_endpoints(Geom::Point const &new_p0, Geom::Point const &new_p1)
{
if (is_empty()) {
return;
}
Geom::Point const offset0( new_p0 - first_point() );
Geom::Point const offset1( new_p1 - last_point() );
Geom::Piecewise<Geom::D2<Geom::SBasis> > pwd2 = _pathv.front().toPwSb();
Geom::Piecewise<Geom::SBasis> arclength = Geom::arcLengthSb(pwd2);
if ( arclength.lastValue() <= 0 ) {
g_error("SPCurve::stretch_endpoints - arclength <= 0");
throw;
}
arclength *= 1./arclength.lastValue();
Geom::Point const A( offset0 );
Geom::Point const B( offset1 );
Geom::Piecewise<Geom::SBasis> offsetx = (arclength*-1.+1)*A[0] + arclength*B[0];
Geom::Piecewise<Geom::SBasis> offsety = (arclength*-1.+1)*A[1] + arclength*B[1];
Geom::Piecewise<Geom::D2<Geom::SBasis> > offsetpath = Geom::sectionize( Geom::D2<Geom::Piecewise<Geom::SBasis> >(offsetx, offsety) );
pwd2 += offsetpath;
_pathv = Geom::path_from_piecewise( pwd2, 0.001 );
}
/**
* sets start of first path to new_p0, and end of first path to new_p1
*/
void
SPCurve::move_endpoints(Geom::Point const &new_p0, Geom::Point const &new_p1)
{
if (is_empty()) {
return;
}
_pathv.front().setInitial(new_p0);
_pathv.front().setFinal(new_p1);
}
/**
* returns the number of nodes in a path, used for statusbar text when selecting an spcurve.
*/
guint
SPCurve::nodes_in_path() const
{
guint nr = 0;
for(Geom::PathVector::const_iterator it = _pathv.begin(); it != _pathv.end(); ++it) {
nr += (*it).size();
nr++; // count last node (this works also for closed paths because although they don't have a 'last node', they do have an extra segment
}
return nr;
}
/**
* Adds p to the last point (and last handle if present) of the last path
*/
void
SPCurve::last_point_additive_move(Geom::Point const & p)
{
if (is_empty()) {
return;
}
_pathv.back().setFinal( _pathv.back().finalPoint() + p );
// Move handle as well when the last segment is a cubic bezier segment:
// TODO: what to do for quadratic beziers?
if ( Geom::CubicBezier const *lastcube = dynamic_cast<Geom::CubicBezier const *>(&_pathv.back().back()) ) {
Geom::CubicBezier newcube( *lastcube );
newcube.setPoint(2, newcube[2] + p);
_pathv.back().replace( --_pathv.back().end(), newcube );
}
}
/*
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 :