On Thu, 22 Mar 2018 19:37:56 -0400, nospam
wrote:
In article , Eric Stevens
wrote:
Is there such a book? Does anyone know?
many of them.
How about a few names.
start he
Apat from the fact that neither of the following are books and
Wikipedia doesn't seem to know anything about either of them
yes wikipedia most certainly does know, and not just the two i listed,
but many others.
there are also books covering the various algorithms, but it's much
easier to read various web sites, which doesn't need to be wikipedia,
given that you seem to be having difficulty connecting to it.
they are
algorithms for implimenting a particular schema for one particular
clipping implimentation.
yep. that's what they are. there are more than just those two.
Even if they existed they would not be what I
was looking for.
they do exist and it's exactly what you claim to be looking for,
however, you will have to learn how to follow a link first.
https://en.wikipedia.org/wiki/Sutherland-Hodgman_algorithm
"Wikipedia does not have an article with this exact name. Please
search for SutherlandHodgman algorithm in Wikipedia to check for
alternative titles or spellings."
https://en.wikipedia.org/wiki/Greiner-Hormann_clipping_algorithm
"Wikipedia does not have an article with this exact name. Please
search for GreinerHormann clipping algorithm in Wikipedia to check
for alternative titles or spellings."
not only does wikipedia have articles for both of the above, but both
links go directly to the respective pages.
They do now for me, but they didn't several hours ago.
you did something wrong or your ****ty newsreader is once again not
handling links correctly.
in other words, user error.
You ar very good at jumping to conclusions.
in addition to descriptions, wikipedia also lists several additional
algorithms and other references:
SutherlandÂ*Hodgman algorithm
See also[edit]
€ WeilerÂ*Atherton clipping algorithm
€ Vatti clipping algorithm
€ Clipping (in rasterisation)
External links[edit]
https://www.cs.drexel.edu/~david/Cla...-05_Polygons.6.
pdf
€ Polygon clipping and filling Describes the algorithm using images
that are easy to understand.
GreinerÂ*Hormann clipping algorithm
See also[edit]
€ Vatti clipping algorithm
€ SutherlandÂ*Hodgman clipping algorithm
€ WeilerÂ*Atherton clipping algorithm
€ Boolean operations on polygons
References[edit]
1 Greiner, GĂĽnther; Kai Hormann (1998). "Efficient clipping of
arbitrary polygons". ACM Transactions on Graphics. 17 (2): 71Â*83.
Retrieved 2014-05-17.
2 Ionel Daniel Stroe. "Efficient Clipping of Arbitrary Polygons".
Retrieved 2014-05-17.
If you had read my original post you would know that I do not want
algorithms.
I want a description of the model which the various algorithms will be
processing.
as i said, it's a start, and now you know what to look for when
searching for books or other materials.
I neither need nor want to dig into the details of the algorithms.
--
Regards,
Eric Stevens