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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics Jg. 26; H. 3-4; S. 207 - 217
1. Verfasser:	Hartley, Richard I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Gordon and Breach Science Publishers 01.01.1989 Taylor and Francis
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!