{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-qcqp-approach-to-triangulation","title":"A QCQP Approach to Triangulation","arxiv_id":"1207.7160","date":"2012-07-31","proceeding":null,"authors":["Chris Aholt","Sameer Agarwal","Rekha Thomas"],"abstract":"Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation problem.","url_abs":"https://arxiv.org/abs/1207.7160v2","url_pdf":"https://arxiv.org/pdf/1207.7160v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-qcqp-approach-to-triangulation","repo_url":"https://github.com/linusnie/robust-triangulation-relaxations","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1207.7160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1207.7160"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/linusnie/robust-triangulation-relaxations","reach":null}],"summary":{"ran_honours":2,"ran_draft_wrong":1},"by_repo_kind":{"listed":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"ce112453709dc070","entry":"get_intrinsics","repo":"linusnie/robust-triangulation-relaxations","repo_kind":"listed","path":"image_matching_experiments.py","file_url":"https://github.com/linusnie/robust-triangulation-relaxations/blob/HEAD/image_matching_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ce112453709dc070"}},{"code_sha256_prefix":"ad90a131234d649c","entry":"load_pickle","repo":"linusnie/robust-triangulation-relaxations","repo_kind":"listed","path":"simulation_experiments.py","file_url":"https://github.com/linusnie/robust-triangulation-relaxations/blob/HEAD/simulation_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"ad90a131234d649c"}},{"code_sha256_prefix":"84a0ae8f42bed6d0","entry":"load_results","repo":"linusnie/robust-triangulation-relaxations","repo_kind":"listed","path":"simulation_experiments.py","file_url":"https://github.com/linusnie/robust-triangulation-relaxations/blob/HEAD/simulation_experiments.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"84a0ae8f42bed6d0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}