Is there a way to get a virtual plane and its intersetion points with some edges/Cuvres?
I tried creating actual planes but it's too time consuming, so am looking for other faster alternative solution.
Has anyone tried implementing something similar?
This is the simplest function for creating a plane.
double origin_point [ 3 ] ,
double plane_normal [ 3 ] ,
tag_t * plane_tag
If you haven't tried the suggested UF call, I would give it a go. This creates a very lightweight plane that is much quicker to create than a DatumPlane feature. It might be OK for you.
Lenovo ThinkPad W540, Win7, 16GB. Developing in: Java | C | KF
Production: [NX188.8.131.52 MP11 64bit] Testing: [NX12.0.2 MP1]
It sounds like your code will intersect the plane with several curves/edges. If so, then the time to create the plane will probably be far less than the time to do the intersections.
There really are no "virtual planes" in NX/Open. SNAP has a bunch of "Geom" objects, including Snap.Geom.Surface.Plane object, and creating one of these does not cause any interaction with the NX part file, so it's very fast.
Thanks for the reply. Yes you are correct ultimately I have to find the intersection point between the plane and a set of edges. Do you have a suggestion for a quicker light weight solution in mind for it?
with respect to the SNAP API, I suppose we should have the SNAP license available to use this API, Right?
Yes, using the SNAP API requires a license. The price is low (I think), but it's not zero. There is a free subset called MiniSnap, but it doesn't include the intersection functions.
As far as I know, the quickest way to create a plane using NX/Open is the UF_MODL_create_plane function that @Technisites recommended.
But, again, I would expect plane creation to be much faster than the subsequent intersections. So, unless you have evidence to show that plane creation is taking up a large percentage of the time, I wouldn't worry about it.
I guess for finding the intersections, the function UF_MODL_intersect_curve_to_plane will be much faster than other methods.