How to find convex hull in a 3 dimensional space

by

Implementing the 3D convex hull is not easy, but many algorithms have been implemented, and code is widely available. At the high end of quality and time investment to use is CGAL. At the lower end on both measures is my own C code:

     DCG Cover
In between there is code all over the web, including this implementation of QuickHull.

More Related Contents:

  1. An algorithm for inflating/deflating (offsetting, buffering) polygons
  2. Sort points in clockwise order?
  3. How do I efficiently determine if a polygon is convex, non-convex or complex?
  4. What is the fastest algorithm to calculate the minimum distance between two sets of points?
  5. How to Compute OBB of Multiple Curves?
  6. Largest circle inside a non-convex polygon
  7. How to check if line segment intersects a rectangle?
  8. robust algorithm for surface reconstruction from 3D point cloud?
  9. Geo Fencing – point inside/outside polygon
  10. What is the fastest way to find the closest point to a given point?
  11. Shortest distance between points algorithm
  12. What is the most efficient algorithm to find a straight line that goes through most points?
  13. Create non-intersecting polygon passing through all given points
  14. Circular approximation of polygon (or its part)
  15. How can I create an internal spiral for a polygon?
  16. Find if a point is inside a convex hull for a set of points without computing the hull itself
  17. Path generation for non-intersecting disc movement on a plane
  18. Compute the area of intersection between a circle and a triangle?
  19. Location of highest density on a sphere
  20. HSL to RGB color conversion
  21. Constant Amortized Time
  22. What exactly does big Ө notation represent?
  23. How to find the intersection point between a line and a rectangle?
  24. What is the difference between tree depth and height?
  25. Finding the median of an unsorted array
  26. How to estimate download time remaining (accurately)?
  27. Sorting in linear time? [closed]
  28. Fast Algorithm to Quickly Find the Range a Number Belongs to in a Set of Ranges?
  29. Calculating permutations in F#
  30. Variation on knapsack – minimum total value exceeding ‘W’

Leave a Comment