Rasmus Brönnegård

I have seen the same thing compiling and running using ubuntu 20.04 inside wsl.

The current implementation of goto() is based on [beam search](https://en.wikipedia.org/wiki/Beam_search) which is heuristic search algorithm that trades away optimality and completeness for reduced memory usage. The search space is also...

My current favorite candidate algorithm right now is bidirectional BFS. * Same memory footprint as regular BFS. * No sorting of the queue. * Typically fewer nodes explored compared to...

I started with a [BFS](https://en.wikipedia.org/wiki/Breadth-first_search) and evolved it into [A*](https://en.wikipedia.org/wiki/A*_search_algorithm) via Dial's algorithm which is [Dijkstra's algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) with a [Bucker queue](https://en.wikipedia.org/wiki/Bucket_queue). The bucket queue is still used by A* instead...

There is a typo in [svd3.rs:45](https://github.com/dimforge/nalgebra/blob/dev/src/linalg/svd3.rs#L45) where `rho0` is swapped with `rho2` but it should be `rho1` that is swapped with `rho2`. I don't think this is the cause of...

Here is an updated test that looks more like the tests in [tests/linalg/svd.rs](https://github.com/dimforge/nalgebra/blob/dev/tests/linalg/svd.rs) ```rs #[test] // Exercises bug reported in issue #1215 of nalgebra (https://github.com/dimforge/nalgebra/issues/1215) fn svd_regression_issue_1215() { let x...

I'm really struggling because of this issue: 

Rerun 0.22.1. The scene is about solving a puzzle with 500 pieces from photos. I'm dumping a few images but mostly lots of 2D points and lines from processing the...

I invited you and the rerun org to https://github.com/rasmusgo/puzzle_bot if you want to take a look. I also uploaded a recording to [google drive](https://drive.google.com/file/d/1qMcs6ZkIWwD7cHjr9t8H0ya1PSTj1Ejl/view?usp=sharing).

Any progress on this?