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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 26; no. 3-4; pp. 207 - 217
Main Author:	Hartley, Richard I.
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.1989 Taylor and Francis
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!