qgsregularpolygon.cpp

Go to the documentation of this file.

/***************************************************************************
                         qgsregularpolygon.cpp
                         --------------
    begin                : May 2017
    copyright            : (C) 2017 by Loïc Bartoletti
    email                : lituus at free dot fr
 ***************************************************************************/
 
/***************************************************************************
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 ***************************************************************************/
 
#include "qgsregularpolygon.h"
 
#include <memory>
 
#include "qgsgeometryutils.h"
 
#include <QString>
 
using namespace Qt::StringLiterals;
 
QgsRegularPolygon::QgsRegularPolygon( const QgsPoint &center, const double radius, const double azimuth, const unsigned int numSides, const ConstructionOption circle )
  : mCenter( center )
{
  // TODO: inclination
 
  if ( numSides >= 3 )
  {
    mNumberSides = numSides;
 
    switch ( circle )
    {
      case InscribedCircle:
      {
        mRadius = std::fabs( radius );
        mFirstVertex = mCenter.project( mRadius, azimuth );
        break;
      }
      case CircumscribedCircle:
      {
        mRadius = apothemToRadius( std::fabs( radius ), numSides );
        mFirstVertex = mCenter.project( mRadius, azimuth - centralAngle( numSides ) / 2 );
        break;
      }
    }
  }
}
 
QgsRegularPolygon::QgsRegularPolygon( const QgsPoint &center, const QgsPoint &pt1, const unsigned int numSides, const ConstructionOption circle )
  : mCenter( center )
{
  if ( numSides >= 3 )
  {
    mNumberSides = numSides;
 
    switch ( circle )
    {
      case InscribedCircle:
      {
        mFirstVertex = pt1;
        mRadius = center.distance( pt1 );
        break;
      }
      case CircumscribedCircle:
      {
        mRadius = apothemToRadius( center.distance( pt1 ), numSides );
        const double azimuth = center.azimuth( pt1 );
        // TODO: inclination
        mFirstVertex = mCenter.project( mRadius, azimuth - centralAngle( numSides ) / 2 );
        break;
      }
    }
  }
}
 
QgsRegularPolygon::QgsRegularPolygon( const QgsPoint &pt1, const QgsPoint &pt2, const unsigned int numSides )
{
  if ( numSides >= 3 )
  {
    mNumberSides = numSides;
 
    const double azimuth = pt1.azimuth( pt2 );
    const QgsPoint pm = QgsGeometryUtils::midpoint( pt1, pt2 );
    const double length = pt1.distance( pm );
 
    const double angle = ( 180 - ( 360 / numSides ) ) / 2.0;
    const double hypothenuse = length / std::cos( angle * M_PI / 180 );
    // TODO: inclination
 
    mCenter = pt1.project( hypothenuse, azimuth + angle );
    mFirstVertex = pt1;
    mRadius = std::fabs( hypothenuse );
  }
}
 
bool QgsRegularPolygon::operator==( const QgsRegularPolygon &rp ) const
{
  return ( ( mCenter == rp.mCenter ) && ( mFirstVertex == rp.mFirstVertex ) && ( mNumberSides == rp.mNumberSides ) );
}
 
bool QgsRegularPolygon::operator!=( const QgsRegularPolygon &rp ) const
{
  return !operator==( rp );
}
 
bool QgsRegularPolygon::isEmpty() const
{
  return ( ( mNumberSides < 3 ) || ( mCenter.isEmpty() ) || ( mFirstVertex.isEmpty() ) || ( mCenter == mFirstVertex ) );
}
 
void QgsRegularPolygon::setCenter( const QgsPoint &center )
{
  const double azimuth = mFirstVertex.isEmpty() ? 0 : mCenter.azimuth( mFirstVertex );
  // TODO: double inclination = mCenter.inclination(mFirstVertex);
  mCenter = center;
  mFirstVertex = center.project( mRadius, azimuth );
}
 
void QgsRegularPolygon::setRadius( const double radius )
{
  mRadius = std::fabs( radius );
  const double azimuth = mFirstVertex.isEmpty() ? 0 : mCenter.azimuth( mFirstVertex );
  // TODO: double inclination = mCenter.inclination(mFirstVertex);
  mFirstVertex = mCenter.project( mRadius, azimuth );
}
 
void QgsRegularPolygon::setFirstVertex( const QgsPoint &firstVertex )
{
  const double azimuth = mCenter.azimuth( mFirstVertex );
  // TODO: double inclination = mCenter.inclination(firstVertex);
  mFirstVertex = firstVertex;
  mCenter = mFirstVertex.project( mRadius, azimuth );
}
 
void QgsRegularPolygon::setNumberSides( const unsigned int numSides )
{
  if ( numSides >= 3 )
  {
    mNumberSides = numSides;
  }
}
 
QgsPointSequence QgsRegularPolygon::points() const
{
  QgsPointSequence pts;
  if ( isEmpty() )
  {
    return pts;
  }
 
  double azimuth = mCenter.azimuth( mFirstVertex );
  const double azimuth_add = centralAngle();
  // TODO: inclination
 
  unsigned int n = 1;
  while ( n <= mNumberSides )
  {
    pts.push_back( mCenter.project( mRadius, azimuth ) );
    azimuth += azimuth_add;
    if ( ( azimuth_add > 0 ) && ( azimuth > 180.0 ) )
    {
      azimuth -= 360.0;
    }
 
    n++;
  }
 
  return pts;
}
 
QgsPolygon *QgsRegularPolygon::toPolygon() const
{
  auto polygon = std::make_unique<QgsPolygon>();
  if ( isEmpty() )
  {
    return polygon.release();
  }
 
  polygon->setExteriorRing( toLineString() );
 
  return polygon.release();
}
 
QgsLineString *QgsRegularPolygon::toLineString() const
{
  auto ext = std::make_unique<QgsLineString>();
  if ( isEmpty() )
  {
    return ext.release();
  }
 
  QgsPointSequence pts;
  pts = points();
 
  ext->setPoints( pts );
  ext->addVertex( pts.at( 0 ) ); //close regular polygon
 
  return ext.release();
}
 
QgsTriangle QgsRegularPolygon::toTriangle() const
{
  if ( isEmpty() || ( mNumberSides != 3 ) )
  {
    return QgsTriangle();
  }
 
  QgsPointSequence pts;
  pts = points();
 
  return QgsTriangle( pts.at( 0 ), pts.at( 1 ), pts.at( 2 ) );
}
 
QVector<QgsTriangle> QgsRegularPolygon::triangulate() const
{
  QVector<QgsTriangle> l_tri;
  if ( isEmpty() )
  {
    return l_tri;
  }
 
  QgsPointSequence pts;
  pts = points();
 
  unsigned int n = 0;
  while ( n < mNumberSides - 1 )
  {
    l_tri.append( QgsTriangle( pts.at( n ), pts.at( n + 1 ), mCenter ) );
    n++;
  }
  l_tri.append( QgsTriangle( pts.at( n ), pts.at( 0 ), mCenter ) );
 
  return l_tri;
}
 
QgsCircle QgsRegularPolygon::inscribedCircle() const
{
  // TODO: inclined circle
  return QgsCircle( mCenter, apothem() );
}
 
QgsCircle QgsRegularPolygon::circumscribedCircle() const
{
  // TODO: inclined circle
  return QgsCircle( mCenter, mRadius );
}
 
QString QgsRegularPolygon::toString( int pointPrecision, int radiusPrecision, int anglePrecision ) const
{
  QString rep;
  if ( isEmpty() )
    rep = u"Empty"_s;
  else
    rep = u"RegularPolygon (Center: %1, First Vertex: %2, Radius: %3, Azimuth: %4)"_s.arg( mCenter.asWkt( pointPrecision ), 0, 's' )
            .arg( mFirstVertex.asWkt( pointPrecision ), 0, 's' )
            .arg( qgsDoubleToString( mRadius, radiusPrecision ), 0, 'f' )
            .arg( qgsDoubleToString( mCenter.azimuth( mFirstVertex ), anglePrecision ), 0, 'f' );
  // TODO: inclination
  // .arg( qgsDoubleToString( mCenter.inclination(mFirstVertex), anglePrecision ), 0, 'f' );
 
  return rep;
}
 
double QgsRegularPolygon::area() const
{
  if ( isEmpty() )
  {
    return 0.0;
  }
 
  return ( mRadius * mRadius * mNumberSides * std::sin( centralAngle() * M_PI / 180.0 ) ) / 2;
}
 
double QgsRegularPolygon::perimeter() const
{
  if ( isEmpty() )
  {
    return 0.0;
  }
 
  return length() * mNumberSides;
}
 
double QgsRegularPolygon::length() const
{
  if ( isEmpty() )
  {
    return 0.0;
  }
 
  return mRadius * 2 * std::sin( M_PI / mNumberSides );
}
 
double QgsRegularPolygon::apothemToRadius( const double apothem, const unsigned int numSides ) const
{
  return apothem / std::cos( M_PI / numSides );
}
 
double QgsRegularPolygon::interiorAngle( const unsigned int nbSides ) const
{
  return ( nbSides - 2 ) * 180 / nbSides;
}
 
double QgsRegularPolygon::centralAngle( const unsigned int nbSides ) const
{
  return 360.0 / nbSides;
}
 
double QgsRegularPolygon::interiorAngle() const
{
  return interiorAngle( mNumberSides );
}
 
double QgsRegularPolygon::centralAngle() const
{
  return centralAngle( mNumberSides );
}