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
|
/*
* SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
* Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice including the dates of first publication and
* either this permission notice or a reference to
* http://oss.sgi.com/projects/FreeB/
* shall be included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
* OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
* Except as contained in this notice, the name of Silicon Graphics, Inc.
* shall not be used in advertising or otherwise to promote the sale, use or
* other dealings in this Software without prior written authorization from
* Silicon Graphics, Inc.
*/
/*
** $Header: /home/krh/git/sync/mesa-cvs-repo/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
|
