Clipping Algorithms

Newsgroups	comp.lang.postscript
Date	2013-08-22 21:37 -0700
Message-ID	<db828cf9-e08e-4ea2-9ea8-7cff1deb382d@googlegroups.com> (permalink)
Subject	Clipping Algorithms
From	luser- -droog <mijoryx@yahoo.com>

Show all headers | View raw

Hodgman-Sutherland works on convex clipping regions, 
requiring additional code to decompose concave paths
into multiple convex paths. Can operate upon a concave
path.

Weiler-Atherton works on concave clipping regions
and concave paths.

Vatti algorithm makes amazing claims, but I haven't dug
up any useful details, yet.


So far, I've just borrowed Cassleman's hodgman-sutherland
code. It's not clear to me how to coordinate the two 
winding-rules with any of the above. Postscript, of course,
offers all its relevant operators in pairs: fill/eofill,
clip/eoclip.

Back to comp.lang.postscript | Previous | Next | Find similar | Unroll thread

Thread

Clipping Algorithms luser- -droog <mijoryx@yahoo.com> - 2013-08-22 21:37 -0700

csiph-web