Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Sutherland–Hodgman algorithm · Vinony

🌐English

English Deutsch Español Français Polski فارسی 中文日本語

EntityQ1808181· pop 8· linked from 9 articles

Sutherland–Hodgman algorithm

algorithm used for clipping polygons

Available in 8 languages

Español
Français
Deutsch
中文
Norwegian
Polski
فارسی

via Wikidata sitelinks · CC0

Connections

Weiler–Atherton clipping algorithm

International Standard Book Number

Categories

Polygon clipping algorithms

Sources

wikipedia.externallinksexternallink

algorithm

Entity

Ivan Sutherland

concave polygon

Communications of the ACM

Sign in to save

What links here9 pages

Boolean operations on polygons

Ivan Sutherland

Weiler–Atherton clipping algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Cuthill–McKee algorithm

Entitydist 0.47

Clenshaw algorithm

Entitydist 0.51

Kernighan–Lin algorithm

Entitydist 0.58

Numerical Recipes

Entitydist 0.59

Marching squares

Entitydist 0.60

Voderberg tiling

Entitydist 0.60

Goertzel algorithm

Entitydist 0.60

list of numerical analysis software

Entitydist 0.60

Ziggurat algorithm

Entitydist 0.62

Tarjan's strongly connected components algorithm

Entitydist 0.62

Laguerre's method

Entitydist 0.63

Geometric Shapes Extended

Entitydist 0.63