#include <stdexcept>
#include "gpc.h"
#include <stdlib.h>
#include <float.h>
#include <math.h>

Include dependency graph for gpc.cpp:

Classes
struct	bbox_shape
class	edge_node
struct	it_shape
class	lmt_node
class	polygon_node
struct	sbt_t_shape
struct	st_shape
struct	v_shape
Defines
#define	ABOVE 0
#define	BELOW 1
#define	CLIP 0
#define	EQ(a, b) (fabs((a) - (b)) <= GPC_EPSILON)
#define	FALSE 0
#define	FREE(p) {if (p) {free(p); (p)= NULL;}}
#define	FWD_MIN(v, i, n)
#define	INVERT_TRISTRIPS FALSE
#define	LEFT 0
#define	MALLOC(p, b, s, t)
#define	N_EDGE(d, e, p, i, j)
#define	NEXT_INDEX(i, n) ((i + 1 ) % n)
#define	NOT_FMAX(v, i, n) (v[NEXT_INDEX(i, n)].vertex.y > v[i].vertex.y)
#define	NOT_RMAX(v, i, n) (v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y)
#define	OPTIMAL(v, i, n)
#define	P_EDGE(d, e, p, i, j)
#define	PREV_INDEX(i, n) ((i - 1 + n) % n)
#define	REV_MIN(v, i, n)
#define	RIGHT 1
#define	SUBJ 1
#define	TRUE 1
#define	VERTEX(e, p, s, x, y)
Typedefs
typedef struct bbox_shape	bbox
typedef struct it_shape	it_node
typedef struct sbt_t_shape	sb_tree
typedef struct st_shape	st_node
typedef struct v_shape	vertex_node
Enumerations
enum	bundle_state { UNBUNDLED, BUNDLE_HEAD, BUNDLE_TAIL }
enum	h_state { NH, BH, TH }
enum	vertex_type { NUL, EMX, ELI, TED, ERI, RED, IMM, IMN, EMN, EMM, LED, ILI, BED, IRI, IMX, FUL }
Functions
static void	add_edge_to_aet (edge_node *aet, edge_node edge, edge_node *prev)
static void	add_intersection (it_node *it, edge_node edge0, edge_node *edge1, double x, double y)
static void	add_left (polygon_node *p, double x, double y)
static void	add_local_min (polygon_node *p, edge_node edge, double x, double y)
static void	add_right (polygon_node *p, double x, double y)
static void	add_st_edge (st_node st, it_node it, edge_node *edge, double dy)
static void	add_to_sbtree (int entries, sb_tree *sbtree, double y)
static void	add_vertex (vertex_node **t, double x, double y)
static edge_node **	bound_list (lmt_node **lmt, double y)
static void	build_intersection_table (it_node *it, edge_node aet, double dy)
static edge_node *	build_lmt (lmt_node lmt, sb_tree sbtree, int sbt_entries, gpc_polygon p, int type, gpc_op op)
static void	build_sbt (int entries, double sbt, sb_tree *sbtree)
static int	count_contours (polygon_node *polygon)
static int	count_optimal_vertices (gpc_vertex_list c)
static int	count_tristrips (polygon_node *tn)
static bbox *	create_contour_bboxes (gpc_polygon *p)
static void	free_sbtree (sb_tree **sbtree)
void	gpc_add_contour (gpc_polygon p, gpc_vertex_list new_contour, int hole)
void	gpc_free_polygon (gpc_polygon *p)
void	gpc_free_tristrip (gpc_tristrip *t)
void	gpc_polygon_clip (gpc_op op, gpc_polygon subj, gpc_polygon clip, gpc_polygon *result)
void	gpc_polygon_to_tristrip (gpc_polygon s, gpc_tristrip t)
void	gpc_tristrip_clip (gpc_op op, gpc_polygon subj, gpc_polygon clip, gpc_tristrip *result)
void	gpc_write_polygon (FILE fp, int write_hole_flags, gpc_polygon p)
static void	insert_bound (edge_node *b, edge_node e)
static void	merge_left (polygon_node p, polygon_node q, polygon_node *list)
static void	merge_right (polygon_node p, polygon_node q, polygon_node *list)
static void	minimax_test (gpc_polygon subj, gpc_polygon clip, gpc_op op)
static void	new_tristrip (polygon_node *tn, edge_node edge, double x, double y)
static void	reset_it (it_node **it)
static void	reset_lmt (lmt_node **lmt)
Variables
const h_state	next_h_state [3][6]

Define Documentation

#define ABOVE 0

Definition at line 106 of file gpc.cpp.

#define BELOW 1

Definition at line 107 of file gpc.cpp.

#define CLIP 0

Definition at line 109 of file gpc.cpp.

#define EQ	(	a,
		b
	)	(fabs((a) - (b)) <= GPC_EPSILON)

Definition at line 121 of file gpc.cpp.

#define FALSE 0

Definition at line 99 of file gpc.cpp.

#define FREE ( p ) {if (p) {free(p); (p)= NULL;}}

Definition at line 155 of file gpc.cpp.

#define FWD_MIN	(	v,
		i,
		n
	)

Value:

((v[PREV_INDEX(i, n)].vertex.y >= v[i].vertex.y) \
                         && (v[NEXT_INDEX(i, n)].vertex.y > v[i].vertex.y))

Definition at line 129 of file gpc.cpp.

#define INVERT_TRISTRIPS FALSE

Definition at line 112 of file gpc.cpp.

#define LEFT 0

Definition at line 103 of file gpc.cpp.

#define MALLOC	(	p,
		b,
		s,
		t
	)

Value:

{if ((b) > 0) { \
                            p= (t*)malloc(b); if (!(p)) { \
                            fprintf(stderr, "gpc malloc failure: %s\n", s); \
                            exit(0);}} else p= NULL;}

Definition at line 150 of file gpc.cpp.

#define N_EDGE	(	d,
		e,
		p,
		i,
		j
	)

Value:

{(d)= (e); \
                            do {(d)= (d)->next;} while (!(d)->outp[(p)]); \
                            (i)= (d)->bot.x + (d)->dx * ((j)-(d)->bot.y);}

Definition at line 146 of file gpc.cpp.

#define NEXT_INDEX	(	i,
		n
	)	((i + 1 ) % n)

Definition at line 124 of file gpc.cpp.

#define NOT_FMAX	(	v,
		i,
		n
	)	(v[NEXT_INDEX(i, n)].vertex.y > v[i].vertex.y)

Definition at line 132 of file gpc.cpp.

#define NOT_RMAX	(	v,
		i,
		n
	)	(v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y)

Definition at line 137 of file gpc.cpp.

#define OPTIMAL	(	v,
		i,
		n
	)

Value:

((v[PREV_INDEX(i, n)].y != v[i].y) || \
                            (v[NEXT_INDEX(i, n)].y != v[i].y))

Definition at line 126 of file gpc.cpp.

#define P_EDGE	(	d,
		e,
		p,
		i,
		j
	)

Value:

{(d)= (e); \
                            do {(d)= (d)->prev;} while (!(d)->outp[(p)]); \
                            (i)= (d)->bot.x + (d)->dx * ((j)-(d)->bot.y);}

Definition at line 142 of file gpc.cpp.

#define PREV_INDEX	(	i,
		n
	)	((i - 1 + n) % n)

Definition at line 123 of file gpc.cpp.

#define REV_MIN	(	v,
		i,
		n
	)

Value:

((v[PREV_INDEX(i, n)].vertex.y > v[i].vertex.y) \
                         && (v[NEXT_INDEX(i, n)].vertex.y >= v[i].vertex.y))

Definition at line 134 of file gpc.cpp.

#define RIGHT 1

Definition at line 104 of file gpc.cpp.

#define SUBJ 1

Definition at line 110 of file gpc.cpp.

#define TRUE 1

Definition at line 100 of file gpc.cpp.

#define VERTEX	(	e,
		p,
		s,
		x,
		y
	)

Value:

{add_vertex(&((e)->outp[(p)]->v[(s)]), x, y); \
                            (e)->outp[(p)]->active++;}

Definition at line 139 of file gpc.cpp.

Typedef Documentation

typedef struct bbox_shape bbox

typedef struct it_shape it_node

typedef struct sbt_t_shape sb_tree

typedef struct st_shape st_node

typedef struct v_shape vertex_node

Enumeration Type Documentation

enum bundle_state

Enumerator:

UNBUNDLED
BUNDLE_HEAD
BUNDLE_TAIL

Definition at line 191 of file gpc.cpp.

enum h_state

Enumerator:

NH
BH
TH

Definition at line 184 of file gpc.cpp.

enum vertex_type

Enumerator:

NUL
EMX
ELI
TED
ERI
RED
IMM
IMN
EMN
EMM
LED
ILI
BED
IRI
IMX
FUL

Definition at line 164 of file gpc.cpp.

Function Documentation

static void add_edge_to_aet	(	edge_node **	aet,
		edge_node *	edge,
		edge_node *	prev
	)		`[static]`

Definition at line 628 of file gpc.cpp.

static void add_intersection	(	it_node **	it,
		edge_node *	edge0,
		edge_node *	edge1,
		double	x,
		double	y
	)		`[static]`

Definition at line 677 of file gpc.cpp.

static void add_left	(	polygon_node *	p,
		double	x,
		double	y
	)		`[static]`

Definition at line 822 of file gpc.cpp.

static void add_local_min	(	polygon_node **	p,
		edge_node *	edge,
		double	x,
		double	y
	)		`[static]`

Definition at line 921 of file gpc.cpp.

static void add_right	(	polygon_node *	p,
		double	x,
		double	y
	)		`[static]`

Definition at line 871 of file gpc.cpp.

static void add_st_edge	(	st_node **	st,
		it_node **	it,
		edge_node *	edge,
		double	dy
	)		`[static]`

Definition at line 712 of file gpc.cpp.

static void add_to_sbtree	(	int *	entries,
		sb_tree **	sbtree,
		double	y
	)		`[static]`

Definition at line 415 of file gpc.cpp.

static void add_vertex	(	vertex_node **	t,
		double	x,
		double	y
	)		`[static]`

Definition at line 965 of file gpc.cpp.

static edge_node** bound_list	(	lmt_node **	lmt,
		double	y
	)		`[static]`

Definition at line 381 of file gpc.cpp.

static void build_intersection_table	(	it_node **	it,
		edge_node *	aet,
		double	dy
	)		`[static]`

Definition at line 762 of file gpc.cpp.

static edge_node* build_lmt	(	lmt_node **	lmt,
		sb_tree **	sbtree,
		int *	sbt_entries,
		gpc_polygon *	p,
		int	type,
		gpc_op	op
	)		`[static]`

Definition at line 483 of file gpc.cpp.

static void build_sbt	(	int *	entries,
		double *	sbt,
		sb_tree *	sbtree
	)		`[static]`

Definition at line 445 of file gpc.cpp.

static int count_contours ( polygon_node * polygon ) [static]

Definition at line 788 of file gpc.cpp.

static int count_optimal_vertices ( gpc_vertex_list c ) [static]

Definition at line 467 of file gpc.cpp.

static int count_tristrips ( polygon_node * tn ) [static]

Definition at line 954 of file gpc.cpp.

static bbox* create_contour_bboxes ( gpc_polygon * p ) [static]

Definition at line 1001 of file gpc.cpp.

static void free_sbtree ( sb_tree ** sbtree ) [static]

Definition at line 456 of file gpc.cpp.

void gpc_add_contour	(	gpc_polygon *	p,
		gpc_vertex_list *	new_contour,
		int	hole
	)

Definition at line 1152 of file gpc.cpp.

void gpc_free_polygon ( gpc_polygon * p )

Definition at line 1093 of file gpc.cpp.

void gpc_free_tristrip ( gpc_tristrip * t )

Definition at line 1832 of file gpc.cpp.

void gpc_polygon_clip	(	gpc_op	op,
		gpc_polygon *	subj,
		gpc_polygon *	clip,
		gpc_polygon *	result
	)

Definition at line 1192 of file gpc.cpp.

void gpc_polygon_to_tristrip	(	gpc_polygon *	s,
		gpc_tristrip *	t
	)

Definition at line 1843 of file gpc.cpp.

void gpc_tristrip_clip	(	gpc_op	op,
		gpc_polygon *	subj,
		gpc_polygon *	clip,
		gpc_tristrip *	result
	)

Definition at line 1854 of file gpc.cpp.

void gpc_write_polygon	(	FILE *	fp,
		int	write_hole_flags,
		gpc_polygon *	p
	)

Definition at line 1132 of file gpc.cpp.

static void insert_bound	(	edge_node **	b,
		edge_node *	e
	)		`[static]`

Definition at line 334 of file gpc.cpp.

static void merge_left	(	polygon_node *	p,
		polygon_node *	q,
		polygon_node *	list
	)		`[static]`

Definition at line 841 of file gpc.cpp.

static void merge_right	(	polygon_node *	p,
		polygon_node *	q,
		polygon_node *	list
	)		`[static]`

Definition at line 891 of file gpc.cpp.

static void minimax_test	(	gpc_polygon *	subj,
		gpc_polygon *	clip,
		gpc_op	op
	)		`[static]`

Definition at line 1034 of file gpc.cpp.

static void new_tristrip	(	polygon_node **	tn,
		edge_node *	edge,
		double	x,
		double	y
	)		`[static]`

Definition at line 980 of file gpc.cpp.

static void reset_it ( it_node ** it ) [static]

Definition at line 308 of file gpc.cpp.

static void reset_lmt ( lmt_node ** lmt ) [static]

Definition at line 321 of file gpc.cpp.

Variable Documentation

const h_state next_h_state[3][6]

Initial value:

{
  
  
   {BH, TH,   TH, BH,   NH, NH},
   {NH, NH,   NH, NH,   TH, TH},
   {NH, NH,   NH, NH,   BH, BH}
}

Definition at line 292 of file gpc.cpp.

Classes

Defines

Typedefs

Enumerations

Functions

Variables

Define Documentation

Typedef Documentation

Enumeration Type Documentation

Function Documentation

Variable Documentation