dogear

enter for all results · esc to close

Chan's Algorithm

sophiedasinger.github.iosite

An optimal output-sensitive algorithm to compute the convex hull of a set of points in 2 or 3 dimensions.

visit sophiedasinger.github.io ↗
0
sign in to dogear this
from
Computational Geometry
added
2026-10-10
likes
0

similar

  1. Convex Hull Algorithms erencan-02.github.io
    site category #computational-geometry link ↗

    A website with visualizations of many convex hull algorithms, including gift wrapping, Graham's scan, quickhull, divide and conquer, monotone chain, and Chan's algorithm.

  2. Qhull qhull.org
    site category #scientific-computing link ↗

    Convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, etc. (C/C++, custom open source license, GitHub)

  3. Convex Hull visualgo.net
    site category #computational-geometry link ↗

    The convex hull of a shape is the smallest convex set that contains it.

  4. Convex Optimization stat.cmu.edu
    site category #computer-vision link ↗
  5. V-HACD github.com
    tool category #game-engine-dev link ↗

    Decomposes a 3D surface into a set of "near" convex parts.

  6. hull.js github.com
    tool category #computational-geometry link ↗

    JavaScript library that builds the convex hull of a set of points.

Computational Geometry › Algorithm Visualizations: “An optimal output-sensitive algorithm to compute the convex hull of a set of points in 2 or 3 dimensions.”