#include "neato.h"
#include "simple.h"
Include dependency graph for legal.c:
Go to the source code of this file.
Defines | |
#define | EQ_PT(v, w) (((v).x == (w).x) && ((v).y == (w).y)) |
Functions | |
void | find_ints (struct vertex vertex_list[], struct polygon polygon_list[], struct data *input, struct intersection ilist[]) |
int | Plegal_arrangement (Ppoly_t **polys, int n_polys) |
#define EQ_PT | ( | v, | |||
w | ) | (((v).x == (w).x) && ((v).y == (w).y)) |
Referenced by Plegal_arrangement().
void find_ints | ( | struct vertex | vertex_list[], | |
struct polygon | polygon_list[], | |||
struct data * | input, | |||
struct intersection | ilist[] | |||
) |
Definition at line 29 of file find_ints.c.
References vertex::active, after, AGERR, agerr(), active_edge_list::final, find_intersection(), active_edge_list::first, free(), GNEW, active_edge::last, N_GNEW, active_edge::name, active_edge::next, data::ninters, active_edge_list::number, data::nvertices, and prior.
Referenced by Plegal_arrangement().
int Plegal_arrangement | ( | Ppoly_t ** | polys, | |
int | n_polys | |||
) |
Definition at line 25 of file legal.c.
References vertex::active, after, EQ_PT, find_ints(), intersection::firstv, free(), MAXINTS, N_GNEW, data::ninters, data::npolygons, data::nvertices, Ppoly_t::pn, vertex::poly, vertex::pos, Ppoly_t::ps, intersection::secondv, Verbose, Pxy_t::x, position::x, intersection::x, position::y, and Pxy_t::y.
Referenced by compoundEdges().