Main Page
Related Pages
Modules
Namespaces
Classes
Files
File List
File Members
IVT
src
DataStructures
KdTree
KdStructs.h
Go to the documentation of this file.
1
// ****************************************************************************
2
// This file is part of the Integrating Vision Toolkit (IVT).
3
//
4
// The IVT is maintained by the Karlsruhe Institute of Technology (KIT)
5
// (www.kit.edu) in cooperation with the company Keyetech (www.keyetech.de).
6
//
7
// Copyright (C) 2014 Karlsruhe Institute of Technology (KIT).
8
// All rights reserved.
9
//
10
// Redistribution and use in source and binary forms, with or without
11
// modification, are permitted provided that the following conditions are met:
12
//
13
// 1. Redistributions of source code must retain the above copyright
14
// notice, this list of conditions and the following disclaimer.
15
//
16
// 2. Redistributions in binary form must reproduce the above copyright
17
// notice, this list of conditions and the following disclaimer in the
18
// documentation and/or other materials provided with the distribution.
19
//
20
// 3. Neither the name of the KIT nor the names of its contributors may be
21
// used to endorse or promote products derived from this software
22
// without specific prior written permission.
23
//
24
// THIS SOFTWARE IS PROVIDED BY THE KIT AND CONTRIBUTORS “AS IS” AND ANY
25
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
26
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
27
// DISCLAIMED. IN NO EVENT SHALL THE KIT OR CONTRIBUTORS BE LIABLE FOR ANY
28
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
29
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
31
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
33
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34
// ****************************************************************************
35
// ****************************************************************************
36
// Filename: KdStructs.h
37
// Author: Kai Welke
38
// Date: 14.04.2005
39
// ****************************************************************************
40
41
42
#ifndef _KD_STRUCTS_H_
43
#define _KD_STRUCTS_H_
44
45
46
47
// a bounding as stored in nodes (BBF)
48
struct
KdBounding
49
{
50
// lower value of bounding
51
float
fLow
;
52
// high value of bounding
53
float
fHigh
;
54
};
55
56
57
// bounding box used for distance to nodes in recursion (BBF)
58
struct
KdBoundingBox
59
{
60
// dimensionality of box (2=rect,3=quader,...)
61
int
nDimension
;
62
63
// low vector
64
float
*
pfLow
;
65
// high vector
66
float
*
pfHigh
;
67
};
68
69
70
71
#endif
/* _KD_STRUCTS_H_ */
KdBounding::fHigh
float fHigh
Definition:
KdStructs.h:53
KdBoundingBox::pfHigh
float * pfHigh
Definition:
KdStructs.h:66
KdBoundingBox::pfLow
float * pfLow
Definition:
KdStructs.h:64
KdBoundingBox::nDimension
int nDimension
Definition:
KdStructs.h:61
KdBoundingBox
Definition:
KdStructs.h:58
KdBounding
Definition:
KdStructs.h:48
KdBounding::fLow
float fLow
Definition:
KdStructs.h:51
asr_ivt
Author(s): Allgeyer Tobias, Hutmacher Robin, Kleinert Daniel, Meißner Pascal, Scholz Jonas, Stöckle Patrick
autogenerated on Mon Dec 2 2019 03:47:28