/usr/include/visp/vpBound.h is in libvisp-dev 2.8.0-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | /****************************************************************************
*
* $Id: vpBound.h 4332 2013-07-22 14:23:46Z fspindle $
*
* This file is part of the ViSP software.
* Copyright (C) 2005 - 2013 by INRIA. All rights reserved.
*
* This software is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* ("GPL") version 2 as published by the Free Software Foundation.
* See the file LICENSE.txt at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using ViSP with software that can not be combined with the GNU
* GPL, please contact INRIA about acquiring a ViSP Professional
* Edition License.
*
* See http://www.irisa.fr/lagadic/visp/visp.html for more information.
*
* This software was developed at:
* INRIA Rennes - Bretagne Atlantique
* Campus Universitaire de Beaulieu
* 35042 Rennes Cedex
* France
* http://www.irisa.fr/lagadic
*
* If you have questions regarding the use of this file, please contact
* INRIA at visp@inria.fr
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
*
* Description:
* Le fichier "bound.h" contient les macros et le types
* utilises par le modele geometrique surfacique polygonale 3D.
*
* Authors:
* Jean-Luc CORRE
*
*****************************************************************************/
#ifndef vpBound_H
#define vpBound_H
#include <visp/vpConfig.h>
#include <visp/vpMy.h>
#ifndef DOXYGEN_SHOULD_SKIP_THIS
#define START_ARG 0
#define NEXT_ARG 1
#define BND_NULL (-1)
#define BND_BLOCK 0
#define BND_CARDIOIDE 1
#define BND_CONE 2
#define BND_CYLINDER 3
#define BND_SPHERE 4
#define BND_TORUS 5
#define BND_WEDGE 6
#define BND_F3 7
#define BND_F4 8
#define BND_GRID 9
#define BND_PIPE 10
#define BND_SECTION 11
#define BND_NBR 12
#define BOUND_NBR 1024
#define FACE_NBR 6144 /* Tailles de tableaux */
#define VERTEX_NBR 16
#define POINT_NBR 6144
#ifdef face_normal
#define VECTOR_NBR 6144
#endif //face_normal
#ifdef face_edge
typedef struct {
Index v0, v1; /* extremites */
Index f0, f1; /* faces */
} Edge;
#endif //face_edge
#ifdef face_edge
typedef struct {
Index nbr; /* nombre d'aretes */
Edge *ptr; /* liste dynamique */
} Edge_list;
#endif //face_edge
#define DEFAULT_VSIZE 4
/*
* Vertex_list :
* Pour optimiser l'allocation et la liberation memoire d'une liste de sommets:
* si (nbr > DEFAULT_VSIZE)
* | alors ptr est alloue et libere dynamiquement
* | sinon ptr = tbl
* fsi;
*/
typedef struct {
Index nbr; /* nombre de sommets */
Index *ptr; /* liste dynamique */
Index tbl[DEFAULT_VSIZE];
} Vertex_list;
typedef struct {
Index nbr; /* nombre de points */
Point3f *ptr; /* liste dynamique */
} Point3f_list;
#ifdef face_normal
typedef struct {
Index nbr; /* nombre de vecteurs */
Vector *ptr; /* liste dynamique */
} Vector_list;
#endif //face_normal
typedef struct {
unsigned is_polygonal:1; /* face polygonale */
unsigned is_visible :1; /* face affichable */
#ifdef face_edge
Edge_list edge; /* liste d'aretes */
#endif //face_edge
Vertex_list vertex; /* liste de sommets */
#ifdef face_normal
Vector normal; /* vecteur normal */
#endif //face_normal
} Face;
typedef struct {
Index nbr; /* nombre de faces */
Face *ptr; /* liste dynamique */
} Face_list;
typedef struct {
unsigned is_display :1; /* surface affichable */
unsigned is_polygonal:1; /* surface polyedrique */
Type type; /* type de la primitive */
#ifdef face_edge
Edge_list edge; /* liste d'aretes */
#endif //face_edge
Face_list face; /* liste de faces */
Point3f_list point; /* points aux sommets */
#ifdef face_normal
Vector_list normal; /* normales aux sommets */
#endif //face_normal
} Bound;
typedef struct {
Index nbr; /* nombre de surfaces */
Bound *ptr; /* liste dynamique */
} Bound_list;
typedef struct {
float xmin, xmax; /* bornes sur l'axe x */
float ymin, ymax; /* bornes sur l'axe y */
float zmin, zmax; /* bornes sur l'axe z */
} Bounding_box;
typedef struct {
char *name; /* nom de la scene */
Bound_list bound; /* liste de surfaces */
} Bound_scene;
typedef struct {
Index nbr; /* nombre de scenes */
Bound_scene *ptr; /* liste dynamique */
} Bound_scene_list;
extern void malloc_huge_Bound (Bound *bp);
extern void free_huge_Bound (Bound *bp);
extern void fscanf_Bound (Bound *bp);
#endif
#endif
|