Viesturs Lācis wrote:
> Is there a way to create a filter that would convert those small, tiny
> G1s into a 3D Nurbs lines?
> <snip>
> The only thing I do not get, is how to do the reverse math - describe
> a line, if (a lot of) points on it are provided. It does not seem to
> be problem finding formulas on the web to calculate a coordinates of a
> point on a described line. But reversing that seems difficult.
>   
Well, this doesn't really destroy information, but it "spreads it out", 
and you have to
take all those points and turn them back into a curve. So, you have to 
identify a
range of points and do a curve fit. If it is a very messy fit, you have 
to narrow the
range and fit it again. If it is a clean fit, then you can extend the 
range and see if the
fit holds over a wider range of points. So, I think it becomes an 
iterative process,
and that means slow. Of course, a modern CPU is a million times faster 
than a
machine tool, so maybe this can actually work in reasonable time, given 
some good
starting heuristics on how to parse the segments.

Jon

------------------------------------------------------------------------------
For Developers, A Lot Can Happen In A Second.
Boundary is the first to Know...and Tell You.
Monitor Your Applications in Ultra-Fine Resolution. Try it FREE!
http://p.sf.net/sfu/Boundary-d2dvs2
_______________________________________________
Emc-users mailing list
Emc-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/emc-users

Reply via email to