I\'ve 开发者_StackOverflowcreated a \"blob\" shape by patching cubic Bezier curves together (screenshot below).I\'d like to be able to detect the situation where a curve has crossed over either itself
Here is some code: struct K : CGAL::Exact_predicates_inexact_constructions_kernel {}; typedef CGAL::Triangulation_vertex_base_2<K>Vb;
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I have a renderer using directx and openGL, and a 3d scene. The view开发者_如何学Cport and the window are of the same dimensions.
Given a union of convex objects and a point p inside this union, how does one find the closest point on the (concave) surface of the union from p?
I\'m primarily a Flash AS3 dev, but I\'m jumping into openframeworks and having trouble using 3D (these examples are in AS)
Closed. This question needs to be more focused. It is not currently accepting answers. 开发者_JAVA百科
I have an issue that I can\'t quite seem to find a starting point on; I\'m not even sure I can describe it well enough to get an answer.
I have 2 coordinates in Lat Long format. How do I determine from Point A (eg New York37.149472,-95.509544 ) the direction in degrees t开发者_Python百科o point B (eg Toronto 40.714269,-74.005973)
There is an image of two separated papers on the floor. How to find the image of the line at infinity corresponding to the plane of the floor?
加载中,请稍侯......