DYT/Tool/OpenSceneGraph-3.6.5/include/geos/index/quadtree/IntervalSize.h
2024-12-25 07:49:36 +08:00

63 lines
1.9 KiB
C++

/**********************************************************************
*
* GEOS - Geometry Engine Open Source
* http://geos.osgeo.org
*
* Copyright (C) 2006 Refractions Research Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
*
* Last port: index/quadtree/IntervalSize.java rev 1.7 (JTS-1.10)
*
**********************************************************************/
#pragma once
#include <geos/export.h>
namespace geos {
namespace index { // geos::index
namespace quadtree { // geos::index::quadtree
/**
* \class IntervalSize
*
* \brief
* Provides a test for whether an interval is
* so small it should be considered as zero for the purposes of
* inserting it into a binary tree.
*
* The reason this check is necessary is that round-off error can
* cause the algorithm used to subdivide an interval to fail, by
* computing a midpoint value which does not lie strictly between the
* endpoints.
*/
class GEOS_DLL IntervalSize {
public:
/**
* This value is chosen to be a few powers of 2 less than the
* number of bits available in the double representation (i.e. 53).
* This should allow enough extra precision for simple computations
* to be correct, at least for comparison purposes.
*/
static const int MIN_BINARY_EXPONENT = -50;
/**
* Computes whether the interval [min, max] is effectively zero width.
* I.e. the width of the interval is so much less than the
* location of the interval that the midpoint of the interval
* cannot be represented precisely.
*/
static bool isZeroWidth(double min, double max);
};
} // namespace geos::index::quadtree
} // namespace geos::index
} // namespace geos