qgspointcloudindex.cpp

Go to the documentation of this file.

/***************************************************************************
                         qgspointcloudindex.cpp
                         --------------------
    begin                : October 2020
    copyright            : (C) 2020 by Peter Petrik
    email                : zilolv at gmail dot com
 ***************************************************************************/
 
/***************************************************************************
 *                                                                         *
 *   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 "qgspointcloudindex.h"
#include <QFile>
#include <QFileInfo>
#include <QDir>
#include <QJsonArray>
#include <QJsonDocument>
#include <QJsonObject>
#include <QTime>
#include <QtDebug>
 
#include "qgstiledownloadmanager.h"
 
IndexedPointCloudNode::IndexedPointCloudNode():
  mD( -1 ),
  mX( 0 ),
  mY( 0 ),
  mZ( 0 )
{}
 
IndexedPointCloudNode::IndexedPointCloudNode( int _d, int _x, int _y, int _z ):
  mD( _d ),
  mX( _x ),
  mY( _y ),
  mZ( _z )
{}
 
IndexedPointCloudNode IndexedPointCloudNode::parentNode() const
{
  return IndexedPointCloudNode( mD - 1, mX / 2, mY / 2, mZ / 2 );
}
 
IndexedPointCloudNode IndexedPointCloudNode::fromString( const QString &str )
{
  QStringList lst = str.split( '-' );
  if ( lst.count() != 4 )
    return IndexedPointCloudNode();
  return IndexedPointCloudNode( lst[0].toInt(), lst[1].toInt(), lst[2].toInt(), lst[3].toInt() );
}
 
QString IndexedPointCloudNode::toString() const
{
  return QStringLiteral( "%1-%2-%3-%4" ).arg( mD ).arg( mX ).arg( mY ).arg( mZ );
}
 
int IndexedPointCloudNode::d() const
{
  return mD;
}
 
int IndexedPointCloudNode::x() const
{
  return mX;
}
 
int IndexedPointCloudNode::y() const
{
  return mY;
}
 
int IndexedPointCloudNode::z() const
{
  return mZ;
}
 
uint qHash( IndexedPointCloudNode id )
{
  return id.d() + id.x() + id.y() + id.z();
}
 
 
//
// QgsPointCloudDataBounds
//
 
QgsPointCloudDataBounds::QgsPointCloudDataBounds() = default;
 
QgsPointCloudDataBounds::QgsPointCloudDataBounds( qint32 xmin, qint32 ymin, qint32 zmin, qint32 xmax, qint32 ymax, qint32 zmax )
  : mXMin( xmin )
  , mYMin( ymin )
  , mZMin( zmin )
  , mXMax( xmax )
  , mYMax( ymax )
  , mZMax( zmax )
{
 
}
 
qint32 QgsPointCloudDataBounds::xMin() const
{
  return mXMin;
}
 
qint32 QgsPointCloudDataBounds::yMin() const
{
  return mYMin;
}
 
qint32 QgsPointCloudDataBounds::xMax() const
{
  return mXMax;
}
 
qint32 QgsPointCloudDataBounds::yMax() const
{
  return mYMax;
}
 
qint32 QgsPointCloudDataBounds::zMin() const
{
  return mZMin;
}
 
qint32 QgsPointCloudDataBounds::zMax() const
{
  return mZMax;
}
 
QgsRectangle QgsPointCloudDataBounds::mapExtent( const QgsVector3D &offset, const QgsVector3D &scale ) const
{
  return QgsRectangle(
           mXMin * scale.x() + offset.x(), mYMin * scale.y() + offset.y(),
           mXMax * scale.x() + offset.x(), mYMax * scale.y() + offset.y()
         );
}
 
QgsDoubleRange QgsPointCloudDataBounds::zRange( const QgsVector3D &offset, const QgsVector3D &scale ) const
{
  return QgsDoubleRange( mZMin * scale.z() + offset.z(), mZMax * scale.z() + offset.z() );
}
 
 
//
// QgsPointCloudIndex
//
 
QgsPointCloudIndex::QgsPointCloudIndex() = default;
 
QgsPointCloudIndex::~QgsPointCloudIndex() = default;
 
bool QgsPointCloudIndex::hasNode( const IndexedPointCloudNode &n ) const
{
  mHierarchyMutex.lock();
  bool found = mHierarchy.contains( n );
  mHierarchyMutex.unlock();
  return found;
}
 
QList<IndexedPointCloudNode> QgsPointCloudIndex::nodeChildren( const IndexedPointCloudNode &n ) const
{
  mHierarchyMutex.lock();
  Q_ASSERT( mHierarchy.contains( n ) );
  QList<IndexedPointCloudNode> lst;
  int d = n.d() + 1;
  int x = n.x() * 2;
  int y = n.y() * 2;
  int z = n.z() * 2;
 
  for ( int i = 0; i < 8; ++i )
  {
    int dx = i & 1, dy = !!( i & 2 ), dz = !!( i & 4 );
    IndexedPointCloudNode n2( d, x + dx, y + dy, z + dz );
    if ( mHierarchy.contains( n2 ) )
      lst.append( n2 );
  }
  mHierarchyMutex.unlock();
  return lst;
}
 
QgsPointCloudAttributeCollection QgsPointCloudIndex::attributes() const
{
  return mAttributes;
}
 
QgsPointCloudDataBounds QgsPointCloudIndex::nodeBounds( const IndexedPointCloudNode &n ) const
{
  qint32 xMin = -999999999, yMin = -999999999, zMin = -999999999;
  qint32 xMax = 999999999, yMax = 999999999, zMax = 999999999;
 
  int d = mRootBounds.xMax() - mRootBounds.xMin();
  double dLevel = ( double )d / pow( 2, n.d() );
 
  xMin = round( mRootBounds.xMin() + dLevel * n.x() );
  xMax = round( mRootBounds.xMin() + dLevel * ( n.x() + 1 ) );
  yMin = round( mRootBounds.yMin() + dLevel * n.y() );
  yMax = round( mRootBounds.yMin() + dLevel * ( n.y() + 1 ) );
  zMin = round( mRootBounds.zMin() + dLevel * n.z() );
  zMax = round( mRootBounds.zMin() + dLevel * ( n.z() + 1 ) );
 
  QgsPointCloudDataBounds db( xMin, yMin, zMin, xMax, yMax, zMax );
  return db;
}
 
QgsRectangle QgsPointCloudIndex::nodeMapExtent( const IndexedPointCloudNode &node ) const
{
  return nodeBounds( node ).mapExtent( mOffset, mScale );
}
 
QgsDoubleRange QgsPointCloudIndex::nodeZRange( const IndexedPointCloudNode &node ) const
{
  return nodeBounds( node ).zRange( mOffset, mScale );
}
 
float QgsPointCloudIndex::nodeError( const IndexedPointCloudNode &n ) const
{
  double w = nodeMapExtent( n ).width();
  return w / mSpan;
}
 
QgsVector3D QgsPointCloudIndex::scale() const
{
  return mScale;
}
 
QgsVector3D QgsPointCloudIndex::offset() const
{
  return mOffset;
}
 
void QgsPointCloudIndex::setAttributes( const QgsPointCloudAttributeCollection &attributes )
{
  mAttributes = attributes;
}
 
int QgsPointCloudIndex::span() const
{
  return mSpan;
}
 
int QgsPointCloudIndex::nodePointCount( const IndexedPointCloudNode &n )
{
  int count = -1;
  mHierarchyMutex.lock();
  if ( mHierarchy.contains( n ) )
    count = mHierarchy.contains( n );
  mHierarchyMutex.unlock();
  return count;
}