%0 Journal Article %1 Huypens_2015 %A Huypens, Valere %D 2015 %I Academy and Industry Research Collaboration Center (AIRCC) %J International Journal of Computer Graphics & Animation %K %N 1 %P 17--37 %R 10.5121/ijcga.2015.5102 %T Relative Squared Distances to a Conic %U http://dx.doi.org/10.5121/ijcga.2015.5102 %V 5 %X The midpoint method or technique is a measurement and as each measurement it has a tolerance, but worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate measurement of the difference of the squared distances of two points to the polar of their midpoint with respect to the conic. When this measurement is valid, it also measures the difference of the squared distances of these points to the conic, although it may be inaccurate, called Out-of-Accuracy or OoA. The primary condition is the necessary and sufficient condition that a measurement is valid. It is comletely new and it can be checked ultra fast and before the actual measurement starts. Modeling an incremental algorithm, shows that the curve must be subdivided into piecewise monotonic sections, the start point must be optimal, and it explains that the 2D-incremental method can find, locally, the global Least Square Distance. Locally means that there are at most three candidate points for a given monotonic direction; therefore the 2D-midpoint method has, locally, at most three measurements. When all the possible measurements are invalid, the midpoint method cannot be applied, and in that case the ultra fast OoC-rule selects the candidate point. This guarantees, for the first time, a 100% stable, ultra-fast, berserkless midpoint algorithm, which can be easily transformed to hardware. The new algorithm is on average (26.5±5)% faster than Mathematica, using the same resolution and tested using 42 different conics. Both programs are completely written in Mathematica and only ContourPlot has been replaced with a module to generate the grid-points, drawn with Mathematica’s GraphicsLinegridpoints function.

@article{Huypens_2015, abstract = {The midpoint method or technique is a measurement and as each measurement it has a tolerance, but worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate measurement of the difference of the squared distances of two points to the polar of their midpoint with respect to the conic. When this measurement is valid, it also measures the difference of the squared distances of these points to the conic, although it may be inaccurate, called Out-of-Accuracy or OoA. The primary condition is the necessary and sufficient condition that a measurement is valid. It is comletely new and it can be checked ultra fast and before the actual measurement starts. Modeling an incremental algorithm, shows that the curve must be subdivided into piecewise monotonic sections, the start point must be optimal, and it explains that the 2D-incremental method can find, locally, the global Least Square Distance. Locally means that there are at most three candidate points for a given monotonic direction; therefore the 2D-midpoint method has, locally, at most three measurements. When all the possible measurements are invalid, the midpoint method cannot be applied, and in that case the ultra fast OoC-rule selects the candidate point. This guarantees, for the first time, a 100% stable, ultra-fast, berserkless midpoint algorithm, which can be easily transformed to hardware. The new algorithm is on average (26.5±5)% faster than Mathematica, using the same resolution and tested using 42 different conics. Both programs are completely written in Mathematica and only ContourPlot[] has been replaced with a module to generate the grid-points, drawn with Mathematica’s Graphics[Line{gridpoints}] function.}, added-at = {2015-02-17T16:49:07.000+0100}, author = {Huypens, Valere}, biburl = {https://www.bibsonomy.org/bibtex/24d4cfd61d5cee7295c80ba91ffa0375f/huypens}, doi = {10.5121/ijcga.2015.5102}, interhash = {bcbf7d7fefe46e44431dd81a0acd6a25}, intrahash = {4d4cfd61d5cee7295c80ba91ffa0375f}, journal = {International Journal of Computer Graphics {\&} Animation}, keywords = {}, month = jan, note = {Ultra fast and 100% stable Incremental Curve Algorithm}, number = 1, pages = {17--37}, publisher = {Academy and Industry Research Collaboration Center ({AIRCC})}, timestamp = {2015-02-17T16:49:07.000+0100}, title = {Relative Squared Distances to a Conic}, url = {http://dx.doi.org/10.5121/ijcga.2015.5102}, volume = 5, year = 2015 }