Jump to content

Information for "Sutherland-Hodgman polygon clipping"

Basic information

Display titleSutherland-Hodgman polygon clipping
Default sort keySutherland-Hodgman polygon clipping
Page length (in bytes)221,196
Namespace ID0
Page ID4326
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)
Page views in the past month0
Page imageSutherland-hodgman.png

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorrosettacode>Dkf
Date of page creation09:36, 23 March 2010
Latest editorPureFox (talk | contribs)
Date of latest edit11:16, 11 February 2024
Total number of edits149
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (9)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The Sutherland-Hodgman clipping algorithm finds the polygon that is the intersection between an arbitrary polygon (the “subject polygon”) and a convex polygon...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.