{"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/polygen-an-autoregressive-generative-model-of","title":"PolyGen: An Autoregressive Generative Model of 3D Meshes","arxiv_id":"2002.10880","date":"2020-02-23","proceeding":"ICML 2020 1","authors":["Charlie Nash","Yaroslav Ganin","S. M. Ali Eslami","Peter W. Battaglia"],"abstract":"Polygon meshes are an efficient representation of 3D geometry, and are of central importance in computer graphics, robotics and games development. Existing learning-based approaches have avoided the challenges of working with 3D meshes, instead using alternative object representations that are more compatible with neural architectures and training approaches. We present an approach which models the mesh directly, predicting mesh vertices and faces sequentially using a Transformer-based architecture. Our model can condition on a range of inputs, including object classes, voxels, and images, and because the model is probabilistic it can produce samples that capture uncertainty in ambiguous scenarios. We show that the model is capable of producing high-quality, usable meshes, and establish log-likelihood benchmarks for the mesh-modelling task. We also evaluate the conditional models on surface reconstruction metrics against alternative methods, and demonstrate competitive performance despite not training directly on this task.","url_abs":"https://arxiv.org/abs/2002.10880v1","url_pdf":"https://arxiv.org/pdf/2002.10880v1.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":"polygen-an-autoregressive-generative-model-of","repo_url":"https://github.com/deepmind/deepmind-research/tree/master/polygen","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"3d-shape-generation","task_name":"3D Shape Generation"},{"task_slug":"3d-geometry","task_name":"3D geometry"},{"task_slug":"surface-reconstruction","task_name":"Surface Reconstruction"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2002.10880","atlas_url":"https://app.syntology.ai/?focus=2002.10880","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2002.10880"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2002.10880\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2002.10880"},"call":"get_concepts_for_paper(arxiv_id=\"2002.10880\")"}],"by_repo":[{"repo":"deepmind/deepmind-research","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":4,"harvested_for":["2006.12982","2101.08692","2103.03206","2105.14039"],"harvested_for_calls":[{"arxiv_id":"2006.12982","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.12982"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.12982\")"},{"arxiv_id":"2101.08692","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.08692"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.08692\")"},{"arxiv_id":"2103.03206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.03206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.03206\")"},{"arxiv_id":"2105.14039","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14039"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14039\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"bc5386ef2e8082ade8fdb570c879b67b270332f9dbe5475c73962496dff7b015","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}