{"id":"1cf67326-5680-4956-be4a-49e51bb45b8a","arxiv_id":"2606.00454","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Subgrid marching tetrahedra generalizes normal coordinates to encode arbitrary surface intersections per grid edge, enabling manifold mesh recovery without Nyquist limits.","lead":"This paper describes a subgrid marching tetrahedra technique that reconstructs manifold triangle meshes from edge piercing points on a tetrahedral grid, supporting multiple surface patches per cell using integer counts. A smart generalist might read it to understand advances in accurate surface reconstruction for computer graphics and geometry processing applications.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Integer edge counts may admit multiple non-isotopic manifold realizations inside a tet","rationale":"The reader's weakest assumption is precisely the load-bearing step for the local reconstruction claim. No other internal inconsistency is visible from the abstract and stated claims; the concern is whether the full paper supplies an algorithm or proof that the counts determine a unique valid surface per tet.","tokens_in":1694,"tokens_out":288,"duration_ms":14599,"concrete_test":"For a single tetrahedron, enumerate all possible triangle configurations realizing edge counts (2,2,2,2,2,2); if more than one topologically distinct manifold surface (different numbers of triangles or different boundary curves) can be formed without self-intersection, the uniqueness assumption fails.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that arbitrary non-negative integer intersection counts on the six edges of a tetrahedron uniquely determine a manifold, intersection-free surface (possibly with boundary) that can be reconstructed locally. Normal surface theory shows that edge coordinates alone do not guarantee uniqueness or embeddability; matching equations across faces and additional constraints (e.g., on triangle types or Euler characteristic) are normally required to rule out intersecting or non-manifold configurations. The paper's per-tet independence therefore rests on an unstated local solver that must enforce these properties from counts alone, without orientation or global data.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper introduces a subgrid marching tetrahedra method for extracting manifold, intersection-free triangle meshes from edge piercing points on a tetrahedral grid. It generalizes normal coordinates from geometric topology to encode surface connectivity via arbitrary non-negative integer intersection counts per grid edge, claiming this allows arbitrarily many patches per cell (bypassing Nyquist limits), handles surfaces with boundary and unoriented input, and supports fully local per-tet reconstruction that produces conforming meshes.","tokens_in":1811,"tokens_out":474,"duration_ms":16502,"significance":"If the local reconstruction from generalized normal coordinates is shown to be correct and unique, the result would be significant for isosurface extraction, mesh repair, and geometry processing by enabling sub-cell feature resolution on fixed grids with a topology-grounded, parameter-free encoding. The explicit connection to normal surface theory is a strength, as is the retention of locality and parallelism from classic marching methods.","major_comments":[{"comment":"§3 (reconstruction from generalized normal coordinates): The central claim that arbitrary integer edge counts uniquely determine a manifold, intersection-free surface inside each tet (without orientation or global data) is load-bearing but rests on an unstated local solver. Normal surface theory requires matching equations across faces and additional constraints to rule out intersections or non-manifold configurations; the manuscript must supply either a formal argument that the per-tet solver enforces these properties from counts alone or explicit validation that no ambiguous realizations exist.","section":"§3"},{"comment":"Abstract and §4 (empirical claims): The statement that meshes are 'far more accurate' than classic marching for equal grid resolution or triangle count is central to the practical contribution but lacks cited quantitative metrics, error tables, or baseline comparisons in the provided description; this must be supported with specific results to substantiate the accuracy advantage.","section":"Abstract, §4"}],"minor_comments":[{"comment":"Notation for generalized normal coordinates should be defined with an explicit example (e.g., a single tet with sample counts) to clarify how the six edge integers map to triangle patches.","section":"§2"},{"comment":"The manuscript should include pseudocode or a clear algorithmic outline for the per-tet solver to make the method reproducible.","section":"§3"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive and insightful comments. We address each major comment below with point-by-point responses, including commitments to revisions that strengthen the presentation without altering the core contributions.","responses":[{"response":"The local solver is presented in §3, where generalized normal coordinates (arbitrary non-negative integer counts on the six edges) are used to enumerate and select valid patch configurations inside the tetrahedron. Because reconstruction is strictly local to one tet and the grid edges are fixed, the counts alone suffice to determine connectivity and prevent intersections or non-manifold junctions by construction; global matching equations are not required. That said, we acknowledge the referee’s point that an explicit formal argument or validation would make the claim more robust. We will therefore add a concise proof sketch plus a small set of exhaustive enumeration examples for representative count combinations in the revised §3, confirming uniqueness and manifold properties.","revision_made":"yes","referee_comment":"[§3] §3 (reconstruction from generalized normal coordinates): The central claim that arbitrary integer edge counts uniquely determine a manifold, intersection-free surface inside each tet (without orientation or global data) is load-bearing but rests on an unstated local solver. Normal surface theory requires matching equations across faces and additional constraints to rule out intersections or non-manifold configurations; the manuscript must supply either a formal argument that the per-tet solver enforces these properties from counts alone or explicit validation that no ambiguous realizations exist."},{"response":"The accuracy advantage is illustrated qualitatively in §4 through examples that capture sub-grid features impossible under classic marching. We agree that quantitative support is needed to substantiate the abstract claim. In the revision we will insert error tables in §4 reporting Hausdorff distance, mean surface error, and RMS error against ground-truth surfaces, for both equal grid resolution and equal output triangle count, with direct side-by-side numbers versus classic marching tetrahedra. These additions will be referenced from the abstract.","revision_made":"yes","referee_comment":"[Abstract, §4] Abstract and §4 (empirical claims): The statement that meshes are 'far more accurate' than classic marching for equal grid resolution or triangle count is central to the practical contribution but lacks cited quantitative metrics, error tables, or baseline comparisons in the provided description; this must be supported with specific results to substantiate the accuracy advantage."}],"tokens_in":1360,"tokens_out":506,"duration_ms":24687,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's central move is to lift classic marching tetrahedra by letting each grid edge carry an arbitrary non-negative integer count of surface intersections, drawn from normal surface theory. This lets a single tet contain multiple disjoint patches or thin sheets, removes the need for inside/outside labels, and still keeps the algorithm local and parallel. That combination is what is actually new relative to standard marching methods.\n\nThe approach is attractive on paper because it promises higher accuracy at the same grid resolution and the same output triangle count, and because it can clean polygon soup into a manifold mesh. The fact that it builds on an existing topological encoding rather than inventing new fitting rules is a point in its favor.\n\nThe soft spot is exactly the one the stress-test flags: normal surface theory shows that edge coordinates by themselves do not guarantee a unique, non-intersecting, manifold realization inside a tet. Matching conditions across faces and extra constraints are usually required. The abstract asserts that a local solver exists that produces the right surface from the counts alone, but supplies no derivation, pseudocode, or example that would let a reader verify this. Without that evidence it is difficult to know whether the method avoids the usual ambiguities or simply assumes they do not arise.\n\nThis is worth a serious referee for the geometry-processing community. People who extract or repair meshes from grids will want to see whether the local reconstruction actually works as claimed and how it scales. I would send it to review rather than desk-reject; the idea is concrete enough that referees can check the missing pieces directly.","headline":"The generalization of normal coordinates to arbitrary per-edge counts is the real novelty, but whether those counts alone fix a unique manifold surface per tet is the part that needs checking.","tokens_in":2267,"tokens_out":393,"would_cite":false,"duration_ms":12569,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Integer intersection counts on grid edges let marching tetrahedra resolve surface features of any size inside one cell.","keywords":["marching tetrahedra","surface reconstruction","normal coordinates","grid-based meshing","manifold meshes","subgrid features","topological encoding"],"falsifier":"A specific assignment of integer counts to the six edges of one tetrahedron for which the procedure either produces intersecting triangles, a non-manifold surface, or fails to match a known valid surface that satisfies those same counts.","tokens_in":2600,"feed_emoji":"","tokens_out":622,"duration_ms":17794,"temperature":0.7,"pith_summary":"The paper introduces a marching tetrahedra algorithm that reconstructs manifold triangle meshes from the places where a continuous surface crosses the edges of a tetrahedral grid. Instead of binary inside/outside labels, it records arbitrary integer counts of intersections along each edge. This encoding determines how surface patches connect inside each tetrahedron, allowing many separate patches or thin sheets within a single cell. The reconstruction stays local to each tetrahedron, needs no consistent orientation or global inside/outside distinction, and produces conforming meshes across cell boundaries.","feed_headline":"Integer counts on edges resolve sub-cell surface features","feed_subtitle":"Generalized normal coordinates let marching tetrahedra extract thin sheets and fine details without inside/outside labels.","key_machinery":"Generalized normal coordinates, which encode connectivity by recording integer intersection counts along each grid edge rather than binary signs.","core_discovery":"The paper claims that surface connectivity inside each tetrahedron is uniquely determined by arbitrary integer intersection counts on its six edges, via a generalization of normal coordinates from geometric topology. This determines a manifold, intersection-free triangulation without reference to a global inside/outside function or consistent input orientations, while still guaranteeing that the output meshes match across shared tet faces.","pith_inferences":["The same count-based encoding might convert arbitrary polygon-soup geometry directly into clean manifold meshes.","Similar integer encodings could extend to other grid-based tasks such as extracting curve networks or higher-dimensional isosurfaces.","Because the method is strictly local, it could be combined with parallel processing or out-of-core techniques for very large grids."],"forward_implications":["Arbitrarily many disconnected surface patches can be recovered inside a single tetrahedron.","Thin sheets and features smaller than the grid spacing are captured without adaptive refinement.","Reconstruction works on surfaces with boundary and on inconsistently oriented input geometry.","The output is always a manifold, intersection-free triangle mesh that conforms across cell boundaries.","For equal grid resolution or equal triangle count, the meshes are more accurate than those from classic marching cubes or tets."],"fun_headline_variants":["Tet edge counts set manifold connectivity","Arbitrary integers on edges triangulate sub-cell surfaces","Normal coordinates generalize to integer tet edge counts","Subgrid surfaces from edge intersection counts only","Six edge counts per tet define manifold triangulation"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"Integer intersection counts on the edges of a tetrahedron are sufficient to determine a unique manifold surface connectivity inside it without ambiguity or extra global information.","fun_headline_variants_meta":{"raw":{"variants":["Tet edge counts set manifold connectivity","Arbitrary integers on edges triangulate sub-cell surfaces","Normal coordinates generalize to integer tet edge counts","Subgrid surfaces from edge intersection counts only","Six edge counts per tet define manifold triangulation"]},"model":"grok-4.3","cost_usd":0.005077,"raw_usage":{"total_tokens":2452,"prompt_tokens":627,"num_sources_used":0,"completion_tokens":56,"cost_in_usd_ticks":50774500,"prompt_tokens_details":{"text_tokens":627,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1769,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":627,"tokens_out":56,"duration_ms":16370,"temperature":1.0,"reasoning_tokens":1769,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T18:25:10.822162+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A specific assignment of integer counts to the six edges of one tetrahedron for which the procedure either produces intersecting triangles, a non-manifold surface, or fails to match a known valid surface that satisfies those same counts.","supporting_citations":[],"review_version":1}