#include <stdio.h>
#include "pathplan.h"
Include dependency graph for simple.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
struct | position |
struct | vertex |
struct | polygon |
struct | intersection |
struct | active_edge |
struct | active_edge_list |
struct | data |
Defines | |
#define | MAXINTS 10000 |
#define | SLOPE(p, q) ( ( ( p.y ) - ( q.y ) ) / ( ( p.x ) - ( q.x ) ) ) |
#define | after(v) (((v)==((v)->poly->finish))?((v)->poly->start):((v)+1)) |
#define | prior(v) (((v)==((v)->poly->start))?((v)->poly->finish):((v)-1)) |
#define after | ( | v | ) | (((v)==((v)->poly->finish))?((v)->poly->start):((v)+1)) |
#define MAXINTS 10000 |
Definition at line 26 of file simple.h.
Referenced by find_intersection(), and Plegal_arrangement().
#define prior | ( | v | ) | (((v)==((v)->poly->start))?((v)->poly->finish):((v)-1)) |
#define SLOPE | ( | p, | |||
q | ) | ( ( ( p.y ) - ( q.y ) ) / ( ( p.x ) - ( q.x ) ) ) |