1 /* 2 Copyright (c) 2006, Michael Kazhdan and Matthew Bolitho 3 All rights reserved. 4 5 Redistribution and use in source and binary forms, with or without modification, 6 are permitted provided that the following conditions are met: 7 8 Redistributions of source code must retain the above copyright notice, this list of 9 conditions and the following disclaimer. Redistributions in binary form must reproduce 10 the above copyright notice, this list of conditions and the following disclaimer 11 in the documentation and/or other materials provided with the distribution. 12 13 Neither the name of the Johns Hopkins University nor the names of its contributors 14 may be used to endorse or promote products derived from this software without specific 15 prior written permission. 16 17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY 18 EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO THE IMPLIED WARRANTIES 19 OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT 20 SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 21 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 22 TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR 23 BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 24 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 25 ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH 26 DAMAGE. 27 */ 28 29 #ifndef BINARY_NODE_INCLUDED 30 #define BINARY_NODE_INCLUDED 31 32 template<class Real> 33 class BinaryNode{ 34 public: CenterCount(int depth)35 static inline int CenterCount(int depth){return 1<<depth;} CumulativeCenterCount(int maxDepth)36 static inline int CumulativeCenterCount(int maxDepth){return (1<<(maxDepth+1))-1;} Index(int depth,int offSet)37 static inline int Index(int depth, int offSet){return (1<<depth)+offSet-1;} CornerIndex(int maxDepth,int depth,int offSet,int forwardCorner)38 static inline int CornerIndex(int maxDepth,int depth,int offSet,int forwardCorner) 39 {return (offSet+forwardCorner)<<(maxDepth-depth);} CornerIndexPosition(int index,int maxDepth)40 static inline Real CornerIndexPosition(int index,int maxDepth) 41 {return Real(index)/(1<<maxDepth);} Width(int depth)42 static inline Real Width(int depth) 43 {return Real(1.0/(1<<depth));} CenterAndWidth(int depth,int offset,Real & center,Real & width)44 static inline void CenterAndWidth(int depth,int offset,Real& center,Real& width) 45 { 46 width=Real(1.0/(1<<depth)); 47 center=Real((0.5+offset)*width); 48 } CenterAndWidth(int idx,Real & center,Real & width)49 static inline void CenterAndWidth(int idx,Real& center,Real& width) 50 { 51 int depth,offset; 52 DepthAndOffset(idx,depth,offset); 53 CenterAndWidth(depth,offset,center,width); 54 } DepthAndOffset(int idx,int & depth,int & offset)55 static inline void DepthAndOffset(int idx, int& depth,int& offset) 56 { 57 int i=idx+1; 58 depth=-1; 59 while(i){ 60 i>>=1; 61 depth++; 62 } 63 offset=(idx+1)-(1<<depth); 64 } 65 }; 66 #endif // BINARY_NODE_INCLUDED 67