partitionY.cc File Reference

#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include "zlassert.h"
#include "partitionY.h"
#include "searchTree.h"
#include "quicksort.h"
#include "polyUtil.h"

Go to the source code of this file.

Defines
#define	max(a, b)   ((a>b)? a:b)
#define	min(a, b)   ((a>b)? b:a)
Functions
static Int	compVertInY (Real A[2], Real B[2])
Int	isBelow (directedLine *v, directedLine *e)
Int	isAbove (directedLine *v, directedLine *e)
Int	isCusp (directedLine *v)
Int	isReflex (directedLine *v)
Int	cuspType (directedLine *v)
sweepRange *	sweepRangeMake (directedLine *left, Int leftType, directedLine *right, Int rightType)
void	sweepRangeDelete (sweepRange *range)
Int	sweepRangeEqual (sweepRange *src1, sweepRange *src2)
inline Real	intersectHoriz (Real x1, Real y1, Real x2, Real y2, Real y)
static Int	compEdges (directedLine *e1, directedLine *e2)
static Int	compInY (directedLine *v1, directedLine *v2)
void	findDiagonals (Int total_num_edges, directedLine **sortedVertices, sweepRange **ranges, Int &num_diagonals, directedLine **diagonal_vertices)
Int	deleteRepeatDiagonals (Int num_diagonals, directedLine **diagonal_vertices, directedLine **new_vertices)
directedLine **	DBGfindDiagonals (directedLine *polygons, Int &num_diagonals)
directedLine *	partitionY (directedLine *polygons, sampledLine **retSampledLines)
void	sweepY (Int nVertices, directedLine **sortedVertices, sweepRange **ret_ranges)