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.

Graham scan · Vinony

🌐English

English Deutsch Español Français Polski Português Русский فارسی ไทย 한국어 中文日本語

EntityQ914780· pop 16· linked from 19 articles

Graham scan

Also known as Graham's scan

algorithm for finding the convex hull of a set of points in the plane

Available in 16 languages

Español
Français
Deutsch
中文
Русский
Português
Catalan
Hebrew
Polski
Romanian
Serbian

Connections

International Standard Book Number

Wayback Machine

Categories

Convex hull algorithms

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

Euclidean vector

Entity

digital object identifier

sorting algorithm

Euclidean distance

Springer Science+Business Media

computational geometry

time complexity

taxicab geometry

Sign in to save

What links here19 pages

gift wrapping algorithm

computational geometry

Chan's algorithm

convex hull algorithm

Similar entities

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

Chan's algorithm

Entitydist 0.13

convex hull algorithm

Entitydist 0.21

Entitydist 0.30

convex polytope

Entitydist 0.39

Möller–Trumbore intersection algorithm

Entitydist 0.46

Iterative closest point

Entitydist 0.47

Entitydist 0.49

Entitydist 0.50

Euclidean minimum spanning tree

Entitydist 0.50

smallest-circle problem

Entitydist 0.54

Entitydist 0.54

closest pair of points problem

Entitydist 0.54