c++ - Get the horizon for a point during incremental Convex Hull 3D -
i'm implementing incremental ch 3d in c++ qt, can't overcome problem:
i have find view horizon of given point:
i have map list of visible faces of given point "pr", don't know how horizon without changing algorithm complexity (it's o(nlogn)).
my idea was: visible faces' edge, check if twin's incident face visible or not. if it's not visible add in horizon edge list, change algorithm's complexity (i think).
note have list have set of points can view given face (maybe helps).
really in advance
if have convex polytopes, , idea should (it's complexity o(1), have results). yep, lookup complexity o(n).
Comments
Post a Comment