2
** License Applicability. Except to the extent portions of this file are
3
** made subject to an alternative license as permitted in the SGI Free
4
** Software License B, Version 1.1 (the "License"), the contents of this
5
** file are subject only to the provisions of the License. You may not use
6
** this file except in compliance with the License. You may obtain a copy
7
** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
8
** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
10
** http://oss.sgi.com/projects/FreeB
12
** Note that, as provided in the License, the Software is distributed on an
13
** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
14
** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
15
** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
16
** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
18
** Original Code. The Original Code is: OpenGL Sample Implementation,
19
** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
20
** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
21
** Copyright in any portions created by third parties is as indicated
22
** elsewhere herein. All Rights Reserved.
24
** Additional Notice Provisions: The application programming interfaces
25
** established by SGI in conjunction with the Original Code are The
26
** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
27
** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
28
** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
29
** Window System(R) (Version 1.3), released October 19, 1998. This software
30
** was created using the OpenGL(R) version 1.2.1 Sample Implementation
31
** published by SGI, but has not been independently verified as being
32
** compliant with the OpenGL(R) version 1.2.1 Specification.
37
** $Header: //depot/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.h#5 $
43
#include "directedLine.h"
44
#include "partitionY.h"
49
directedLine* chainHead;
50
directedLine* chainTail;
53
monoChain* nextPolygon; //a list of polygons
57
Real minX, maxX, minY, maxY;
60
//for efficiently comparing two chains
62
directedLine* current;
65
monoChain(directedLine* cHead, directedLine* cTail);
68
inline void setNext(monoChain* n) {next = n;}
69
inline void setPrev(monoChain* p) {prev = p;}
70
inline void setNextPolygon(monoChain* np) {nextPolygon = np;}
71
inline monoChain* getNext() {return next;}
72
inline monoChain* getPrev() {return prev;}
73
inline directedLine* getHead() {return chainHead;}
74
inline directedLine* getTail() {return chainTail;}
76
inline void resetCurrent() { current = ((isIncrease==1)? chainHead:chainTail);}
79
void deleteLoopList();
81
//insert a new chain between prev and this
82
void insert(monoChain* nc);
84
Int numChainsSingleLoop();
85
Int numChainsAllLoops();
86
monoChain** toArrayAllLoops(Int& num_chains);
87
Int toArraySingleLoop(monoChain** array, Int index);
90
Real keyY; //the current horizotal line
91
Real chainIntersectHoriz(Real y); //updates current incrementally for efficiency
92
directedLine* find(Real y);//find dline so that y intersects dline.
95
void printChainLoop();
100
monoChain* directedLineLoopToMonoChainLoop(directedLine* loop);
101
monoChain* directedLineLoopListToMonoChainLoopList(directedLine* list);
102
Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges);
104
void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices,
105
sweepRange** ranges, Int& num_diagonals,
106
directedLine** diagonal_vertices);
108
directedLine* MC_partitionY(directedLine *polygons, sampledLine **retSampledLines);