Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.postscript > #1581 > unrolled thread

Clipping Algorithms

Back to article view | Back to comp.lang.postscript

Contents

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

#1581 — Clipping Algorithms

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.

[toc] | [standalone]

Back to top | Article view | comp.lang.postscript

csiph-web