{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/predicting-the-next-best-view-for-3d-mesh","title":"Predicting the Next Best View for 3D Mesh Refinement","arxiv_id":"1805.06207","date":"2018-05-16","proceeding":null,"authors":["Luca Morreale","Andrea Romanoni","Matteo Matteucci"],"abstract":"3D reconstruction is a core task in many applications such as robot\nnavigation or sites inspections. Finding the best poses to capture part of the\nscene is one of the most challenging topic that goes under the name of Next\nBest View. Recently, many volumetric methods have been proposed; they choose\nthe Next Best View by reasoning over a 3D voxelized space and by finding which\npose minimizes the uncertainty decoded into the voxels. Such methods are\neffective, but they do not scale well since the underlaying representation\nrequires a huge amount of memory. In this paper we propose a novel mesh-based\napproach which focuses on the worst reconstructed region of the environment\nmesh. We define a photo-consistent index to evaluate the 3D mesh accuracy, and\nan energy function over the worst regions of the mesh which takes into account\nthe mutual parallax with respect to the previous cameras, the angle of\nincidence of the viewing ray to the surface and the visibility of the region.\nWe test our approach over a well known dataset and achieve state-of-the-art\nresults.","url_abs":"http://arxiv.org/abs/1805.06207v1","url_pdf":"http://arxiv.org/pdf/1805.06207v1.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":"abstracts"},"code_links":[{"paper_slug":"predicting-the-next-best-view-for-3d-mesh","repo_url":"https://github.com/luca-morreale/stochastic-nbv-4-mesh-refinement","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"3d-reconstruction","task_name":"3D Reconstruction"},{"task_slug":"robot-navigation","task_name":"Robot Navigation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"luca-morreale/stochastic-nbv-4-mesh-refinement","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"48a20c4eea8e5f1fdfbc857e4105319cc8d6267b8d5005c5def7641c54b75c54","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}