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.

الگوریتم چان · Vinony

🌐فارسی

English Deutsch Français Tiếng Việt Русский فارسی 日本語

EntityQ2025538· pop 8· linked from 10 articles

الگوریتم چان

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

Available in 8 languages

Français
Deutsch
Русский
Hungarian
Tiếng Việt
Ukrainian
فارسی

via Wikidata sitelinks · CC0

Connections

gift wrapping algorithm

International Standard Book Number

Categories

Convex hull algorithms

Sources

wikipedia.externallinksexternallink

logarithm

Entity

digital object identifier

binary search algorithm

computational geometry

time complexity

Institut National de Recherche en Informatique et en Automatique

Jiří Matoušek

convex hull algorithm

Bernard Chazelle

Sign in to save

What links here10 pages

gift wrapping algorithm

list of programmers

computational geometry

convex hull algorithm

double exponential function

Similar entities

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

Entitydist 0.13

convex hull algorithm

Entitydist 0.18

Entitydist 0.32

convex polytope

Entitydist 0.44

Möller–Trumbore intersection algorithm

Entitydist 0.48

Iterative closest point

Entitydist 0.49

Euclidean minimum spanning tree

Entitydist 0.50

smallest-circle problem

Entitydist 0.51

Entitydist 0.52

Entitydist 0.52

Entitydist 0.55

Entitydist 0.56