{"id":"14570d66-83e0-4555-bdc6-8e5bec2f74d9","arxiv_id":"2506.05268","paper_version":2,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"Uniform white-noise samples on an implicit surface can be obtained by taking all intersection points of uniformly random rays with the surface.","lead":"This paper studies a method that places random points evenly over a 3D surface by casting random rays through its bounding box and keeping every ray-surface hit. It is aimed at shapes defined implicitly, such as neural network surfaces, where mesh-based sampling is expensive or impossible, and the method is simpler and cheaper than common alternatives.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The uniformity guarantee is conditional on a valid global Lipschitz bound for sphere tracing; for neural implicits this bound is only estimated, so missed ray intersections can silently bias the samples.","rationale":"I read the paper as making a sound theoretical claim: sampling rays uniformly with respect to the invariant oriented-line measure and taking all intersections does produce uniform surface samples, and the bounding-box ray construction in Algorithm 1 correctly realizes the restricted line measure. The stress-tested weak point is the numerical bridge from that theorem to Algorithm 2. The proof requires an oracle for all intersections; sphere tracing only provides that oracle when lambda is a certified Lipschitz bound and epsilon is small enough to resolve all features. For neural implicits, lambda is typically estimated rather than certified, so a user can silently miss intersections and bias the sample distribution. This is exactly the reader's weakest assumption, and it is a genuine correctness risk for the practical method. It does not overturn the ACCEPT verdict because the theoretical contribution stands, the paper acknowledges the Lipschitz dependence in its limitations, and the experimental methodology is reasonable for a graphics venue. However, the abstract's 'guarantees uniformity' language should be read as conditional on the numerical precondition, and a certified-lambda experiment would strengthen the claim for neural representations.","tokens_in":20120,"tokens_out":25527,"duration_ms":351679,"concrete_test":"For one SIREN and one NeuS model used in Figures 3 and 12, compute a certified upper bound on the network's Lipschitz constant (e.g., by interval bound propagation or layer-wise spectral-norm products). Rerun Algorithm 2 with this certified lambda on a fixed set of rays, and in parallel run a dense reference root finder along the same rays to enumerate ground-truth intersections. If the certified lambda differs from the lambda used in the paper, or if any ray's intersection set from Algorithm 2 differs from the reference, the implementation violates the theorem's precondition; quantify the resulting bias by recomputing the TV score against the mesh ground truth.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that collecting every intersection of a uniformly sampled ray with the zero level set yields a uniform surface sample. The proof in Sections 3.2 and Appendix A assumes exact knowledge of all ray-surface intersections. Algorithm 2 obtains those intersections by sphere tracing with step size |f(p)|/lambda, which is safe only if lambda is a true upper bound on the Lipschitz constant of f (Section 4.2). For the paper's headline neural-implicit examples (SIREN, NeuS), lambda is not certified; it is estimated, and Section 4.3 explicitly notes that such fields 'encourage SDF-ness but do not guarantee it and may have large global Lipschitz bounds.' If the supplied lambda underestimates the true Lipschitz constant, the tracer can step over zero crossings without recording them, and the surviving point set is no longer the image of the theoretical uniform line process. The reported TV scores on neural fields therefore test an implementation precondition, not the uniformity theorem itself. The paper's own Limitations section concedes this dependency, but the abstract's unqualified claim that the method 'guarantees uniformity' overstates what is established for the main target representation.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a method for uniformly sampling points on implicit surfaces by sampling random rays through a bounding box and collecting every intersection of each ray with the zero level set. The authors justify uniformity via Cauchy-Crofton integral geometry, present a sphere-tracing modification to find all intersections under a Lipschitz bound, and validate the method against meshes, rejection sampling, Hamiltonian Monte Carlo, and marching-cubes-based sampling. They further demonstrate extensions to blue noise, stratified sampling via sparse voxels, moment estimation, curvature-based resampling, and neural implicit deformation.","tokens_in":20267,"tokens_out":21107,"duration_ms":262074,"significance":"The core observation is correct and useful: if the ray-intersection subroutine is exact and the ray distribution is the standard isotropic one, the collected points are uniform in the sense of equidistribution, following established Cauchy-Crofton theory. The paper contributes a self-contained proof of the 1-equidistribution of the resampling view in Appendix A, a practical sphere-marching variant to collect all intersections, and a broad set of applications. The experimental comparison on 114 meshes against a ground-truth uniform sampler is solid both in uniformity (total variation score) and in cost (number of implicit function evaluations). The main weaknesses are in the specification of the algorithm and the unqualified guarantee for neural implicits whose Lipschitz bounds are only estimated.","major_comments":[{"comment":"The pseudocode does not implement the full-line intersection process required by the theory. In Algorithm 1, origins o_i are sampled in the plane through the origin normal to d_i; in Algorithm 2, tracing starts at t=0 at o_i and only advances t upward until t<length(ℓ_i). For a line whose intersection with the bounding box straddles that plane, only the forward half of the line is traced, so intersections on the backward half are never recorded. Moreover, the update p ← o_i + t d_i/λ together with t ← t + s makes the termination test dimensionally inconsistent with the parameterization of ℓ_i in Algorithm 1. Please specify the bounding-box chord interval [t_min, t_max] explicitly and trace the entire interval, or move the ray origins to a plane outside the bounding box; in either case, reconcile the step-size parameterization with the ray parameter used in the termination test.","section":"Section 4.1-4.2, Algorithm 1 and Algorithm 2"},{"comment":"The uniformity guarantee is stated without qualification, but Algorithm 2's sphere tracing is safe only if λ is a true upper Lipschitz bound of f. As the paper itself notes in Section 4.3, neural implicits such as SIREN and NeuS 'encourage SDF-ness but do not guarantee it and may have large global Lipschitz bounds.' For those headline examples λ is estimated rather than certified, and an underestimate can cause missed zero crossings and biased samples. Please scope the guarantee to exact ray intersection or to a certified Lipschitz bound, or provide empirical evidence on neural fields with known mesh ground truth that the estimated λ is sufficient in the tested regimes.","section":"Abstract, Section 4.2-4.3"}],"minor_comments":[{"comment":"The sentence 'subsample our uniform a samples as blue noise' appears to contain a typo; it should read 'subsample our uniform samples as blue noise.'","section":"Section 6.4"},{"comment":"The proof relies on the limit ∑ k_i/M from [PPK16], yet the footnote states that the proof in [PPK16] has an error and omits a factor of 2/|L|. Since the corrected proof is said to follow the same argument, it would be helpful to include that corrected derivation explicitly rather than leaving the reader to reconstruct it.","section":"Appendix A"},{"comment":"The neural field examples in Figure 12 are qualitative; the quantitative TV evaluations in Section 5 are all on mesh-derived signed distance functions, where λ is known. A quantitative uniformity measurement on at least one neural implicit with an estimated Lipschitz bound would make the practical claim more convincing.","section":"Figure 12 and Section 5"},{"comment":"The text describes a '2√3-sided square'; this is the side length of the square, not its diagonal. The wording could be clarified to avoid ambiguity about the sampling domain.","section":"Algorithm 1"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the scope of the venue and the central theoretical idea is sound. I suspect the Algorithm 2 issue is a presentation bug rather than a flaw in the authors' implementation, but it must be fixed before publication because the algorithm listing is part of the contribution. The Lipschitz precondition is acknowledged in the limitations; asking for a qualification of the abstract's guarantee and, ideally, one neural-field uniformity experiment would suffice."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Worth a serious look. The real contribution here is not the line-intersection idea, which goes back to Cauchy-Crofton and [PPK16], but the fact that this paper turns it into a working tool for modern implicit and neural surfaces. Algorithm 1 gives a clean, correct way to sample uniform rays through a bounding box, Algorithm 2 is a sensible all-intersection sphere tracer, and the evaluation is the first systematic one I know of for this approach. The TV experiments on mesh SDFs are convincing: at 50k samples the method matches the mesh ground truth, and the function-evaluation counts are an order of magnitude better than rejection sampling or marching cubes. The corrected proof of the resampling equivalence in Appendix A is a nice touch, and the authors are honest that [PPK16] contains an error they fix. The main soft spot is exactly what the stress-test note flags: the uniformity guarantee is provable only for the idealized process of collecting every intersection. In practice, Algorithm 2 finds intersections by sphere tracing with step size |f(p)|/lambda, which is safe only when lambda is a true upper bound on the Lipschitz constant. For neural implicits like SIREN and NeuS, that bound is estimated, not certified, and an underestimate can silently skip zero crossings and bias the samples. The paper's own Limitations section concedes this, saying such fields encourage SDF-ness but do not guarantee it, yet the abstract's unqualified guarantees uniformity overstates what is actually established for the headline representation. This is a numerical precondition rather than a flaw in the theory, so I do not read it as fatal, but it should be addressed: either soften the abstract or add experiments with certified bounds. Minor issues: the epsilon tolerance places samples slightly off-surface, and no code or data are provided, so reproduction requires reimplementation. The full k-equidistribution proof is deferred to the literature, though the 1-equidistribution argument is self-contained and sufficient for most practical claims. Who is this for? Anyone doing geometry processing or neural implicit fitting who needs on-surface samples without mesh extraction or projection. It deserves a serious referee, and I would send it to review as-is, asking for clarification of the Lipschitz caveat and ideally code release.","headline":"Solid, useful paper: the uniformity theorem is classical, but the practical ray-casting package for implicit surfaces is well-engineered, with the caveat that the guarantee is conditional on a valid Lipschitz bound.","tokens_in":764,"tokens_out":654,"would_cite":true,"duration_ms":26241,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65D18","60D05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Uniformly sampling rays through a bounding box and keeping every intersection with an implicit surface yields uniform white-noise surface samples.","keywords":["uniform sampling","implicit surfaces","ray casting","sphere tracing","Cauchy-Crofton formula","white noise sampling","neural implicit surfaces","blue noise sampling"],"falsifier":"Take an analytic torus inside $[-1,1]^3$, cast $M$ uniformly sampled rays using the exact continuous ray-torus intersection solver, bin the collected samples on a toroidal grid, and compare the per-bin proportions with the analytically known area distribution by total variation distance; if the distance does not converge to zero as $M\\to\\infty$, the claimed uniformity is false. The same test with an artificially underestimated Lipschitz bound in the sphere-tracing version should visibly miss thin features and inflate the total variation score.","tokens_in":19866,"feed_emoji":"🎲","tokens_out":11298,"duration_ms":125484,"temperature":0.7,"pith_summary":"The paper establishes that a classic geometric fact—random lines through a shape hit its surface in a pattern that mirrors surface area—can be turned into a practical, general-purpose sampler for implicit surfaces. It proves that casting uniformly distributed rays through a bounding box and recording every intersection with the zero level set produces white-noise samples that are area-proportional, in the strong sense of $k$-equidistribution, so no projection or mesh extraction is required. For signed-distance-like functions the intersection step is computed by sphere tracing with a known Lipschitz bound, and the paper demonstrates on neural and analytic implicits that this costs orders of magnitude fewer function evaluations than rejection sampling or marching cubes while matching or improving their uniformity. The payoff is a single primitive that feeds blue-noise generation, stratified sampling via sparse voxels, deformations of neural surfaces, and direct estimation of surface area, volume, and centroids.","feed_headline":"Random rays through a box sample any implicit surface uniformly","feed_subtitle":"No mesh extraction or projection: every intersection of a cast ray counts, and the samples are provably uniform.","key_machinery":"The carrying mechanism is the line-integral identity behind the Cauchy-Crofton formula: an integral of a function over a surface can be written as a constant times an integral over all oriented lines of the sum of the function's values at that line's intersections with the surface. Sampling the compact set of lines meeting the bounding box and returning every intersection lets each surface point be weighted by the number of sampled lines through it, and since each point lies on exactly one line per direction, a $k$-equidistributed line sequence produces a $k$-equidistributed point sequence. The practical tracer is a modified sphere march: with a known Lipschitz bound $\\lambda$, step by $|f(p)|/\\lambda$, record each zero crossing, then keep marching instead of stopping at the first hit.","core_discovery":"The central claim is that a surface sampler can be built directly from a ray-intersection subroutine: if oriented lines are sampled uniformly from the set of lines meeting a bounding box around the surface, and every intersection of each line with the surface is collected, then the resulting point sequence is $k$-equidistributed, hence uniform white noise on the surface. The paper proves this from the Cauchy-Crofton relation and shows that it holds for any surface representation with a ray tracer, including neural implicit functions when a modified sphere tracer marches with steps of size $|f(p)|/\\lambda$. No mesh extraction and no projection step is needed, and sampled points lie exactly on the zero level set. The same framework yields surface area, volume, and centroid estimators from intersection and chord-length statistics, and the paper verifies uniformity on 114 mesh-based implicit surfaces against baselines of rejection sampling, Hamiltonian Monte Carlo, and marching-cubes extraction.","pith_inferences":["Because the theorem requires only $k$-equidistributed rays rather than statistically independent ones, deterministic low-discrepancy ray sets should inherit the uniformity guarantee, and the paper's convergence experiments already hint that such sets improve moment-estimation rates.","The intersection and chord statistics that feed the uniform samples also give an unbiased area and volume estimator whose cost scales with surface area, suggesting an unexplored use as a differentiable surrogate loss for shape optimization or reconstruction where ray generation is independent of surface parameters.","For neural fields whose global Lipschitz constant is only estimated, uniformity in practice depends on the supplied bound being a true upper bound; coupling sphere tracing with conservative interval bounds or rigorous Lipschitz estimation would make the numeric sampler match the theoretical guarantee.","The same line-intersection idea should extend to planar intersections of a surface to sample curves, or to higher-dimensional varieties, though average chord-length formulas imply efficiency falls as dimension increases."],"forward_implications":["Any surface representation with a ray-intersection subroutine—implicit signed distance functions, unsigned distance fields, neural fields, and even Gaussian particle scenes—can be uniformly sampled without meshing or projection.","On neural implicit surfaces the sampler is orders of magnitude cheaper than rejection sampling or marching-cubes extraction, with comparable or better measured uniformity.","Because samples lie exactly on the surface and are area-proportional, the same ray-casting pass yields unbiased Monte Carlo estimates of surface area, enclosed volume, shell centroid, and volumetric centroid.","Subsampling the white-noise output produces blue noise, sparse voxel partitioning gives stratified low-variance sampling, and the same machinery handles offset surfaces, open boundaries, and non-manifold geometry.","The 2D restriction of the algorithm uniformly samples planar implicit outlines, which the paper connects to vector-graphics and font-generation tasks."],"supporting_citations":[{"why":"Supplies the theorem that uniformly sampling lines and taking all intersections yields a $k$-equidistributed sequence of surface samples, the core uniformity result the paper builds on.","marker":"[PPK16]"},{"why":"Provides the Cauchy-Crofton integral-geometry relation connecting surface integrals to line integrals, used both in the uniformity proof and in the moment formulas.","marker":"[San76]"},{"why":"Defines sphere tracing with Lipschitz-based steps, which the paper modifies to enumerate every intersection along a ray rather than only the first.","marker":"[Har96]"},{"why":"Gives the resampled importance sampling framework used in the proof that ray resampling with weights proportional to intersection count reproduces the same uniform distribution.","marker":"[Tal05]"},{"why":"Earlier ray-based surface sampler whose requirement of an a priori maximum intersection count is avoided by the all-intersections strategy, and which serves as a prior art comparison.","marker":"[DHJM08]"},{"why":"Hamiltonian Monte Carlo level-set sampler used as a baseline for both uniformity and function-evaluation cost.","marker":"[Chi22]"},{"why":"Dataset of 114 mesh-based implicit functions with known geometry, used to measure total-variation uniformity and evaluation counts against a ground-truth area-proportional sampler.","marker":"[MPZ14]"}],"fun_headline_variants":["Ray casting samples any implicit surface uniformly","Uniform surface samples from random ray intersections","No mesh extraction: sample implicit surfaces with rays","Proven uniform sampling via ray-surface intersections"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The method needs a global Lipschitz bound for the implicit function that is a true upper bound everywhere in the box; when the supplied bound is too small, the tracing step can jump past a zero crossing and the sample distribution silently stops being uniform.","fun_headline_variants_meta":{"raw":{"variants":["Ray casting samples any implicit surface uniformly","Uniform surface samples from random ray intersections","No mesh extraction: sample implicit surfaces with rays","Proven uniform sampling via ray-surface intersections"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001056,"raw_usage":{"total_tokens":4405,"prompt_tokens":893,"completion_tokens":3512,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":509,"completion_tokens_details":{"reasoning_tokens":3458}},"tokens_in":509,"tokens_out":3512,"duration_ms":26919,"temperature":1.0,"reasoning_tokens":3458,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T10:22:49.315085+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take an analytic torus inside $[-1,1]^3$, cast $M$ uniformly sampled rays using the exact continuous ray-torus intersection solver, bin the collected samples on a toroidal grid, and compare the per-bin proportions with the analytically known area distribution by total variation distance; if the distance does not converge to zero as $M\\to\\infty$, the claimed uniformity is false. The same test with an artificially underestimated Lipschitz bound in the sphere-tracing version should visibly miss thin features and inflate the total variation score.","supporting_citations":[],"review_version":1}