AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A Fast Resection-Intersection Method for the Known Rotation Problem

CVPR 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 10 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use parallel rather than sequential Res-IntRes-Int · House (S), Lund (S), Yard, Tower, UWO (L), and Lund (L), KRotruntime (seconds): 3.15 -> 2.97; 4.70 -> 3.28; 782.69 -> 245.10; 387.24 -> 128.02; 2,347.70 -> 698.84; 5,880.40 -> 2,978.25Helped
Use FDM instead of Dai [6] for triangulationTriangulation · House (S), Lund (S), Yard, Tower, UWO (L), and Lund (L)average runtime per instance (milliseconds): 28.02 -> 0.30; 28.17 -> 0.29; 57.67 -> 1.06; 53.90 -> 0.85; 64.04 -> 1.19; 73.04 -> 1.25Helped
Use Res-Int (par) instead of Proximal [11]KRot · House (S), Lund (S), Yard, and Towerruntime (seconds): 19.18 -> 2.97; 14.49 -> 3.28; 3,313.10 -> 245.10; 1,374.90 -> 128.02Helped
Use Res-Int (par) instead of Proximal [11]KRot · UWO (L) and Lund (L)runtime (seconds)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy