Reassembling polygons from edges

Many geometric algorithms accept as input a set of polygons specified by their sequence of vertices and give as output a set of polygons which result from some operation on the input polygons. For instance, the output may represent the contour of the union of the polygons. In many cases a plane-swee...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of computer mathematics Ročník 26; číslo 3-4; s. 207 - 217
Hlavný autor:	Hartley, Richard I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Gordon and Breach Science Publishers 01.01.1989 Taylor and Francis
Predmet:	Applied sciences Computer aided design Computer science; control theory; systems derived polygon Exact sciences and technology F.2.2 plane-sweep algorithm Polygon Software space efficient algorithm Intersection Edge boundary Ordering Geometric figure Polygon Algorithm Computer aided design
ISSN:	0020-7160, 1029-0265
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!