Skip to main content
MathOverflow

Return to Question

Post Closed as "Not suitable for this site" by R.P., Chris Godsil, user44191, Leo Alonso, Per Alexandersson
Became Hot Network Question
Edited tags. Embedded picture.
Source Link
edit approved Sep 22, 2019 at 13:19
Rodrigo de Azevedo
edit approved Sep 22, 2019 at 13:19
Rodrigo de Azevedo
  • 1
  • 3
  • 16
  • 35

I know some algorithms which compute the convex hull in a continuous space. Are there efficient algorithms to compute it in a discrete domain? For example in 3D discrete space, given the blue points, we want the convex hull including the green points.

figureenter image description here

I know some algorithms which compute the convex hull in a continuous space. Are there efficient algorithms to compute it in a discrete domain? For example in 3D discrete space, given the blue points, we want the convex hull including the green points.

figure

I know some algorithms which compute the convex hull in a continuous space. Are there efficient algorithms to compute it in a discrete domain? For example in 3D discrete space, given the blue points, we want the convex hull including the green points.

enter image description here

Source Link
Smith
Smith
  • 49
  • 2

Convex hull in a discrete space

I know some algorithms which compute the convex hull in a continuous space. Are there efficient algorithms to compute it in a discrete domain? For example in 3D discrete space, given the blue points, we want the convex hull including the green points.

figure