From 93976df61eba98ec1462cc9dfeed4b2f37d1a29c Mon Sep 17 00:00:00 2001 From: Ricardo Fabbri Date: Wed, 19 Jun 2024 06:58:18 -0700 Subject: [PATCH] new --- README.md | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index b6d11ca..e1c45fd 100644 --- a/README.md +++ b/README.md @@ -4,8 +4,11 @@ ## MINUS: MInimial problem NUmerical continuation Solver ![Build Status](https://github.com/rfabbri/minus/actions/workflows/compile_and_run_test.yml/badge.svg?branch=master) -This package originated in solving medium-sized (eg, degree > 100) square problems -(ie, exactly-determined, 0-dimensional), notably in computer vision where +**New!!!** Macaulay HC scripts available at minus/tutorial to help building your fast +solver prototype. + +A C++ framework capable of solving medium-sized (eg, degree > 100) square +polynomial systems (ie, exactly-determined, 0-dimensional), and which is currently *fastest than any other package* for the CPU, notably in computer vision where trifocal minimal problems from points and lines are of importance (as in curve-based structure from motion, where lines are tangents to curves). As of this date, such problems are too high degree to be solved symbolically,