mirror of
https://github.com/CloudCompare/PoissonRecon.git
synced 2026-08-30 00:50:28 +08:00
mkazhdan
73 lines
3.8 KiB
C++
73 lines
3.8 KiB
C++
/*
|
|
Copyright (c) 2006, Michael Kazhdan and Matthew Bolitho
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
Redistributions of source code must retain the above copyright notice, this list of
|
|
conditions and the following disclaimer. Redistributions in binary form must reproduce
|
|
the above copyright notice, this list of conditions and the following disclaimer
|
|
in the documentation and/or other materials provided with the distribution.
|
|
|
|
Neither the name of the Johns Hopkins University nor the names of its contributors
|
|
may be used to endorse or promote products derived from this software without specific
|
|
prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO THE IMPLIED WARRANTIES
|
|
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
|
|
SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
|
|
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
|
|
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
|
|
DAMAGE.
|
|
*/
|
|
|
|
#ifndef BINARY_NODE_INCLUDED
|
|
#define BINARY_NODE_INCLUDED
|
|
|
|
class BinaryNode
|
|
{
|
|
public:
|
|
static inline size_t CenterCount( unsigned int depth ) { return (size_t)1<<depth; }
|
|
static inline size_t CornerCount( unsigned int depth ) { return ((size_t)1<<depth)+1; }
|
|
static inline size_t CumulativeCenterCount( unsigned int maxDepth ) { return ((size_t)1<<(maxDepth+1))-1; }
|
|
static inline size_t CumulativeCornerCount( unsigned int maxDepth ) { return ((size_t)1<<(maxDepth+1))+maxDepth; }
|
|
static inline size_t CenterIndex( unsigned int depth , size_t offSet ) { return ((size_t)1<<depth)+offSet-1; }
|
|
static inline size_t CornerIndex( unsigned int depth , size_t offSet ) { return ((size_t)1<<depth)+offSet-1+depth; }
|
|
|
|
static inline size_t CornerIndex( unsigned int maxDepth , unsigned int depth , size_t offSet , int forwardCorner ){ return (offSet+forwardCorner)<<(maxDepth-depth); }
|
|
template< class Real > static inline Real Width( unsigned int depth ){ return Real(1.0/((size_t)1<<depth)); }
|
|
template< class Real > static inline void CenterAndWidth( unsigned int depth , size_t offset , Real& center , Real& width ){ width = Real (1.0/((size_t)1<<depth) ) , center = Real((0.5+offset)*width); }
|
|
template< class Real > static inline void CornerAndWidth( unsigned int depth , size_t offset , Real& corner , Real& width ){ width = Real(1.0/((size_t)1<<depth) ) , corner = Real(offset*width); }
|
|
template< class Real > static inline void CenterAndWidth( size_t idx , Real& center , Real& width )
|
|
{
|
|
unsigned int depth;
|
|
size_t offset;
|
|
CenterDepthAndOffset( idx , depth , offset );
|
|
CenterAndWidth( depth , offset , center , width );
|
|
}
|
|
template< class Real > static inline void CornerAndWidth( size_t idx , Real& corner , Real& width )
|
|
{
|
|
unsigned int depth;
|
|
size_t offset;
|
|
CornerDepthAndOffset( idx , depth , offset );
|
|
CornerAndWidth( depth , offset , corner , width );
|
|
}
|
|
static inline void CenterDepthAndOffset( size_t idx , unsigned int &depth , size_t &offset )
|
|
{
|
|
offset = idx , depth = 0;
|
|
while( offset>=((size_t)1<<depth) ) offset -= ((size_t)1<<depth) , depth++;
|
|
}
|
|
static inline void CornerDepthAndOffset( size_t idx , unsigned int &depth , size_t &offset )
|
|
{
|
|
offset = idx , depth = 0;
|
|
while( offset>=( ((size_t)1<<depth)+1 ) ) offset -= ( ((size_t)1<<depth)+1 ) , depth++;
|
|
}
|
|
};
|
|
|
|
#endif // BINARY_NODE_INCLUDED
|