Hi,
I am looking for a method of determining whether or not an
arbitrary 3D convex polygon ( but it surface is always flat ) projected onto the XZ plane intersects with a rectangle on the XZ plane...
http://www.experts-exchange.com/Programming/Languages/CPP/Q_10058648.html
Zones:
C++Date Answered: 07/09/1998 Grade: C Views: 27
given a vector<POINT> of points and another POINT i need to generate the convex hull of points and then determine point is inside or on the line of the convex hull. i have tried to implement graham...
http://www.experts-exchange.com/Programming/Languages/CPP/Q_21122330.html
Zones:
C++Date Answered: 11/15/2004 Grade: A Views: 0
Hi,
Is there an incremental algorithm for convex-hull (in the plane) construction in O(nlogn) ?
That is, we add the points one by one, and each step takes O(logn) time (not amortized, but exact...
http://www.experts-exchange.com/Other/Math_Science/Q_22065073.html
hi ppl,
I need a code in "C programming" or in C++ to find a convex hull for a given set of points on a 2 dimentional plane.
The input should contain a set of 15 points on a 2-D xy plane.
P (...
http://www.experts-exchange.com/Programming/Languages/CPP/Q_22520542.html
Zones:
C++,
CDate Answered: 05/17/2008 Grade: A Views: 144
I think this is really easy, however, since I'm gonna be pretty specific, I'm givin' it 100 pts... ;-)
Anyway.... this is an ALGORITHM question not c++, but I couldn't find a better spot for it (a...
http://www.experts-exchange.com/Programming/Languages/CPP/Q_10007851.html
Zones:
C++Date Answered: 04/14/1997 Grade: B Views: 0
Hi,
How can I find the ball inscribed in a 3D convex-hull (with n vertices) in O(n) time?
Thanks!
http://www.experts-exchange.com/Other/Math_Science/Q_22122426.html
