/* position.h */ /* Beacon triangulation algorithms. {{{ * * Copyright (C) 2011 Florent Duchon * * APBTeam: * Web: http://apbteam.org/ * Email: team AT apbteam DOT org * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * * }}} */ #ifndef _POSITION_H #define _POSITION_H #define MAX_OBSTACLE 2 #define MAX_BEACON 3 #define MAX_TEMP_POSITION MAX_OBSTACLE * 2 #define OBSTACLE_RADIUS 100 #define IGNORE_ANGLE 1000 /* Status returns */ typedef enum{ POSITION_NO_ERROR, POSITION_IGNORE_ANGLE } TPositionStatus; /* Structures definition */ /* Beacon Structure */ typedef struct { int angleNumber; float angle[MAX_OBSTACLE+1]; }beacon_s; /* Obstacle structure */ typedef struct { int x; int y; int trust; }opponent_s; /* Coordinates structure */ typedef struct { int x; int y; }coord_s; /* Recovery Structure */ typedef struct { int x; int y; int occurence; }recovery_s; /* This function is used to initialize all needed structures */ void init_struct(void); #endif