1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
** License Applicability. Except to the extent portions of this file are
** made subject to an alternative license as permitted in the SGI Free
** Software License B, Version 1.1 (the "License"), the contents of this
** file are subject only to the provisions of the License. You may not use
** this file except in compliance with the License. You may obtain a copy
** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
**
** http://oss.sgi.com/projects/FreeB
**
** Note that, as provided in the License, the Software is distributed on an
** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
**
** Original Code. The Original Code is: OpenGL Sample Implementation,
** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
** Copyright in any portions created by third parties is as indicated
** elsewhere herein. All Rights Reserved.
**
** Additional Notice Provisions: The application programming interfaces
** established by SGI in conjunction with the Original Code are The
** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
** Window System(R) (Version 1.3), released October 19, 1998. This software
** was created using the OpenGL(R) version 1.2.1 Sample Implementation
** published by SGI, but has not been independently verified as being
** compliant with the OpenGL(R) version 1.2.1 Specification.
**
** $Date: 2001-03-17 00:25:41 $ $Revision: 1.1 $
*/
/*
** $Header: /cvs/mesa/Mesa/src/glu/sgi/libnurbs/nurbtess/directedLine.h,v 1.1 2001-03-17 00:25:41 brianp Exp $
*/
#ifndef _DIRECTEDLINE_H
#define _DIRECTEDLINE_H
#include "definitions.h"
#include "sampledLine.h"
enum {INCREASING, DECREASING};
class directedLine {
short direction; /*INCREASING or DECREASING*/
sampledLine* sline;
directedLine* next; /*double linked list*/
directedLine* prev; /*double linked list*/
/*in case we need a list of polygons each
*consisting of a double linked list
*/
directedLine* nextPolygon;
/*optimization make cutoff polygon faster*/
/* directedLine* prevPolygon;*/
Int rootBit; /*1 if this is a root of the polygon, set by setRootBit*/
/*and reset by resetRootBit()*/
directedLine* rootLink; /*fast root-finding*/
public:
directedLine(short dir, sampledLine* sl);
directedLine();
~directedLine();
void init(short dir, sampledLine* sl);
Real* head(); /*points[0] if INCREASING, points[n-1] otherwise*/
Real* tail(); /*points[n-1] if INCREASING, points[0] otherwise*/
Real* getVertex(Int i); /*points[i] if INCREASING, points[n-1-i] otherwise*/
Int get_npoints() {return sline->get_npoints();}
directedLine* getPrev() {return prev;}
directedLine* getNext() {return next;}
directedLine* getNextPolygon() {return nextPolygon;}
sampledLine* getSampledLine() {return sline;}
short getDirection(){return direction;}
void putDirection(short dir) {direction = dir;}
void putPrev(directedLine *p) {prev = p;}
void putNext(directedLine *p) {next = p;}
/*insert a new line between prev and this*/
void insert(directedLine* nl);
/*delete all the polygons following the link: nextPolygon.
*notice that sampledLine is not deleted. The caller is
*responsible for that
*/
void deletePolygonList();
void deleteSinglePolygon();
void deleteSinglePolygonWithSline(); //also delete sanmpled line
void deletePolygonListWithSline(); //also delete sanmpled line
void deleteSingleLine(directedLine* dline);
directedLine* deleteDegenerateLines();
directedLine* deleteDegenerateLinesAllPolygons();
directedLine* cutIntersectionAllPoly(int& cutOccur);
/*check to see if the list forms a closed polygon
*return 1 if yes
*/
short isPolygon();
Int compInY(directedLine* nl);
Int compInX(directedLine* nl);
/*return an array of pointers.
*the
*/
directedLine** sortAllPolygons();
Int numEdges();
Int numEdgesAllPolygons();
Int numPolygons();
/*check if the head of this edge is connected to
*the tail of the prev
*/
short isConnected();
Real polyArea();
void printSingle();
void printList();
void printAllPolygons();
void writeAllPolygons(char* filename);
/*insert a polygon: using nextPolygon*/
directedLine* insertPolygon(directedLine* newpolygon);
directedLine* cutoffPolygon(directedLine *p);
Int toArraySinglePolygon(directedLine** array, Int index);
directedLine** toArrayAllPolygons(Int& total_num_edges);
void connectDiagonal(directedLine* v1, directedLine* v2,
directedLine** ret_p1,
directedLine** ret_p2,
sampledLine** generatedLine, directedLine* list);
/*generate two slines
*/
void connectDiagonal_2slines(directedLine* v1, directedLine* v2,
directedLine** ret_p1,
directedLine** ret_p2,
directedLine* list);
Int samePolygon(directedLine* v1, directedLine* v2);
void setRootBit() {rootBit = 1;}
void resetRootBit() {rootBit = 0;}
directedLine* findRoot();
void rootLinkSet(directedLine* r) {rootLink = r;}
directedLine* rootLinkFindRoot();
//the chain from begin to end is deleted (the space is deallocated)
//and a new edge(which connectes the head of begin and the tail of end)
// is inserted. The new polygon is returned.
//notice that "this" is arbitrary
directedLine* deleteChain(directedLine* begin, directedLine* end);
};
directedLine* readAllPolygons(char* filename);
extern Int compV2InY(Real A[2], Real B[2]);
extern Int compV2InX(Real A[2], Real B[2]);
#endif
|
