/*****************************************************************************
*   "Irit" - the 3d polygonal solid modeller.				     *
*									     *
* Written by:  Gershon Elber				Ver 0.2, Mar. 1990   *
******************************************************************************
*   Definitions, local to modules, of Boolean operation modules:	     *
*****************************************************************************/

#ifndef BOOLEAN_LH
#define BOOLEAN_LH

/*   The following structure is used to keep the intersecting segments of    */
/* each polygons, which the other object polygons. they are saved as a       */
/* list of segments, which can form a closed loop (if totally internal) or   */
/* an open one (in which the two ends intersects the polygon boundaries).    */
/*   Note all the polygons of the two given objects must be convex!	     */
typedef struct InterSegmentStruct {
    PointType PtSeg[2];		       /* The two end points of the segment. */
    /* If intersect polygon vertex, point on it. If internal to poly, NULL.  */
    VertexStruct *V[2];
    PolygonStruct *Pl;	       /* Point on the (other) intersecting polygon. */
    struct InterSegmentStruct *Pnext;
} InterSegmentStruct;

/* Used to hold list of InterSegment polylines: */
typedef struct InterSegListStruct {
    InterSegmentStruct *PISeg,		  /* Point to InterSegment Polyline. */
	*PISegMaxX;			   /* Used in closed loops handling. */
    struct InterSegListStruct *Pnext;		  /* Point to next polyline. */
} InterSegListStruct;

/* Used in sorting of open loops: */
typedef struct SortOpenStruct {
    RealType Key;
    InterSegListStruct *PLSeg;		/* Point to open loop with this key. */
    struct SortOpenStruct *Pnext;		   /* Point to next in list. */
} SortOpenStruct;

/* The following are temporary flags used to mark the original vertices in   */
/* the resulting object. Used to detected edges originated in the input	     */
/* object, and used to propagate the adjacencies.			     */
#define ORIGINAL_TAG 0x10

#define	IS_ORIGINAL_VRTX(Vrtx)	((Vrtx)->Tags & ORIGINAL_TAG)
#define	SET_ORIGINAL_VRTX(Vrtx)	((Vrtx)->Tags |= ORIGINAL_TAG)
#define	RST_ORIGINAL_VRTX(Vrtx)	((Vrtx)->Tags &= ~ORIGINAL_TAG)


/* The following are temporary flags used to mark the polygons in the	     */
/* adjacencies propagation. Can use bit 4-7 of PolygonStruct Tags only.      */
#define COMPLETE_TAG   0x10 /* Complete Tag - Polygon has no intersection.   */
#define IN_OUTPUT_TAG  0x20 /* InOutput Tag - Polygon should be in output.   */
#define ADJ_PUSHED_TAG 0x40 /* AdjPushed Tag - Polygon has been pushed.	     */

#define	IS_COMPLETE_POLY(Poly)	((Poly)->Tags & COMPLETE_TAG)
#define	SET_COMPLETE_POLY(Poly)	((Poly)->Tags |= COMPLETE_TAG)
#define	RST_COMPLETE_POLY(Poly)	((Poly)->Tags &= ~COMPLETE_TAG)
#define	IS_INOUTPUT_POLY(Poly)	((Poly)->Tags & IN_OUTPUT_TAG)
#define	SET_INOUTPUT_POLY(Poly)	((Poly)->Tags |= IN_OUTPUT_TAG)
#define	RST_INOUTPUT_POLY(Poly)	((Poly)->Tags &= ~IN_OUTPUT_TAG)
#define	IS_ADJPUSHED_POLY(Poly)	((Poly)->Tags & ADJ_PUSHED_TAG)
#define	SET_ADJPUSHED_POLY(Poly) ((Poly)->Tags |= ADJ_PUSHED_TAG)
#define	RST_ADJPUSHED_POLY(Poly) ((Poly)->Tags &= ~ADJ_PUSHED_TAG)

#ifdef __MSDOS__
#define ADJ_STACK_SIZE	1024		/* Adjacency of polygons stack size. */
#else
#define ADJ_STACK_SIZE	16386		/* Adjacency of polygons stack size. */
#endif /* __MSDOS__ */

/* FatalError types are defined below. Usually, they will cause empty result.*/
#define FTL_BOOL_NO_INTER	1	/* No intersection between operands. */
#define FTL_BOOL_CTRL_BRK	2	       /* Control break was pressed. */
#define FTL_BOOL_FPE		3		    /* Floating point error. */

/* Boolean operations types: */
#define BOOL_OPER_OR	1
#define BOOL_OPER_AND	2
#define BOOL_OPER_SUB	3
#define BOOL_OPER_NEG	4
#define BOOL_OPER_CUT	5
#define BOOL_OPER_MERGE	6

extern int BooleanOutputInterCurve;	/* Kind of output from boolean oper. */

/* Prototypes of local functions in Bool-Hi.c module: */
void TestBooleanCtrlBrk(void);
void FatalBooleanError(int ErrorType);

/* Prototypes of local functions in Bool-Low.c module: */
ObjectStruct *BooleanLow1Out2(ObjectStruct *PObj1, ObjectStruct *PObj2);
ObjectStruct *BooleanLow1In2(ObjectStruct *PObj1, ObjectStruct *PObj2);
void SortOpenInterList(PolygonStruct *Pl, InterSegListStruct **POpen);
VertexStruct *InterLoopToVrtxList(InterSegmentStruct *PIHead);
VertexStruct *GenReverseVrtxList(VertexStruct *VIn);
void LoopsFromInterList(PolygonStruct *Pl,
		InterSegListStruct **PlClosed, InterSegListStruct **PlOpen);
ObjectStruct *ExtractPolygons(ObjectStruct *PObj, int AinB);

#endif /* BOOLEAN_LH */