Pith. sign in

REVIEW 4 major objections 5 minor 297 references

Points as Tori: Fast Pointwise Signed Distance for Point Clouds

T0 review · 4 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Signed distance to a point cloud can be computed by blending locally fitted tori, pointwise and fast, with no global solves or meshing.

desk verdict Clever and practical point-cloud SDF method with a nice theoretical frame, but the learned coefficients are the load-bearing part and they demonstrably choke on denser samplings. read the letter →

arxiv 2607.16946 v1 pith:WTEB4RLO submitted 2026-07-18 cs.GR cs.CV

Nicole Feng , Ioannis Gkioulekas , Keenan Crane This is my paper
classification cs.GRcs.CV MSC 68U0565D1735F21
keywords signeddistancefunctionpointcloudtorusfittingconvolutionalapproximationwindingnumberPoissonsurfacereconstructionHopf-Coletransformationneuralcoefficients
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that signed distance to the surface underlying an oriented point cloud can be approximated by fitting a torus to the neighborhood of each point, then blending the closed-form torus distance functions with an exponentially weighted, self-normalized average. The blend is justified as a Laplace-method limit of a screened potential, which the authors show unifies signed distance with winding numbers and Poisson surface reconstruction. Because each torus is fitted by a pre-trained network that outputs six local surface coefficients, inference is a per-point feed-forward pass followed by a sum over nearby points—no global optimization, grid, or meshing. If correct, this gives an output-sensitive, parallelizable SDF that turns raw point clouds directly into usable signed distance fields for offsets, Booleans, morphological operations, and sphere tracing.

What carries the argument

The central object is the self-normalized convolutional distance formula (Eq. 17, evaluated in shifted form Eq. 25): a kernel-density average of per-point functions g_i weighted by exp(-lambda |x-p_i|), which by Laplace's method converges to the value of g at the closest point as lambda grows. The blended functions g_i are SDFs of tori fitted to each point via six learned polynomial coefficients (shift, first/second fundamental forms), chosen so the torus equator passes through the shifted point with matching principal curvatures. The theoretical load-bearing piece is the signed Hopf-Cole transformation, which turns the viscous eikonal equation into a jump screened Laplace equation and shows

What would settle it

Take a point cloud whose sampling density is well outside the training range (e.g., 10x denser with strong noise), fit tori, and compare the zero level set and SDF gradient norms against ground truth on a shape with known SDF. If the level sets deviate systematically while a classical local fit (e.g., tuned weighted least squares quadratic) stays accurate, the learned coefficients, not the blending formula, are the cause; the paper's Fig. 29 already hints at such a failure mode.

Watch

Extended reading notes

Core claim

The paper's central claim is that the self-normalized exponential blend of per-point torus SDFs (Algorithm 1 / Eq. 25) approximates the signed distance to the surface underlying a point cloud, simultaneously reconstructing the surface as the zero level set and providing distance elsewhere. The authors show analytically that among convolutional distance formulas only the self-normalized form (Eq. 17) can avoid the fundamental limitation of 'snapping' to the sampled points, provided the per-point functions carry second-order surface information; tori are chosen because their SDFs are closed form and they reproduce up to second-order local geometry. The torus parameters come from a small pre-tr

Load-bearing premise

The whole method hinges on the pre-trained network's torus coefficients transferring to unseen sampling conditions—density, noise, holes, topology—since the blend just interpolates whatever per-point functions it is given.

Editorial extensions

If this is right

  • Point clouds with normals become directly usable in SDF-based pipelines: offsets, Booleans, morphological dilation/erosion, and sphere tracing, with no intermediate mesh.
  • The method is output-sensitive: query cost is roughly 10^-4 to 10^-3 seconds per point on million-point clouds, and evaluations parallelize, making per-query distance feasible at arbitrary resolution.
  • The theory places winding numbers and Poisson surface reconstruction as limiting cases (screening parameter -> 0) of the same screened-Laplace formulation, so signed distance, occupancy, and reconstruction are unified in one framework.
  • Robustness to noise, outliers, uneven sampling, and inconsistently oriented normals is claimed, including an optional iterative orientation procedure driven by SDF gradients.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the blend is as robust as claimed, the representation is a natural differentiable shape proxy for inverse rendering and optimization: because tori are analytic, gradients of the SDF flow through the network outputs, so point clouds could be optimized directly as shape parameters.
  • The theory suggests a testable equivalence: for closed clean geometry, tuning the screening parameter lambda should interpolate continuously between winding-number-style occupancy (lambda small) and true distance (lambda large); checking this on a known shape would separate the theory from the learned torus fitting.
  • The learned-coefficient bottleneck could be replaced: if a non-learned, robust torus-fitting scheme were developed, the method's generality and failure modes would change; the paper itself flags this as future work.
  • Sampling density is a known weak spot (the paper's Fig. 29 shows interior SDF can worsen as sampling densifies); a denser-trained variant or adaptive neighborhood sizing would be a direct extension.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper introduces “Points as Tori” (PAT), a method for computing signed distance to an oriented point cloud without global optimization or spatial discretization. For each input point, a pre-trained transformer predicts six polynomial coefficients of a local surface patch; these coefficients determine a fitted torus with a closed-form SDF. The global SDF is then the exponentially weighted, self-normalized blend of per-point torus SDFs (Eq. 1 / Algorithm 1, evaluated as Eq. 25). The theoretical part derives convolutional distance formulas from a signed Hopf–Cole transformation, connects them to winding numbers, Poisson surface reconstruction, and other classic methods, and argues that only the self-normalized formula (Eq. 17) is viable for point clouds. Experiments show fast pointwise queries on clouds up to 29M points, qualitative reconstructions from photogrammetry and other sources, and competitive accuracy on sparse (512-point) datasets. The paper is clearly written and contains substantial theoretical and algorithmic content.

Significance. If the central claim holds—that a pre-trained network can produce per-point torus coefficients that generalize to unseen point clouds and yield a faithful SDF—PAT would be a significant contribution: it offers an output-sensitive, parallelizable, differentiable SDF representation for point clouds, avoiding per-shape fitting and global solves. The theoretical unification of signed distance with winding numbers and Poisson surface reconstruction is elegant and of independent interest. The paper also makes a credible case that the learned component is minimal, with the hard global problem handled by the analytical blend. However, the central accuracy claim is currently conditional: the paper’s own experiments show that density changes degrade the interior SDF (Fig. 29), and the evaluation does not quantitatively cover the density, noise, hole, and topology variation that real point clouds exhibit. The omission of area weights in Eq. 25 is defended only by a hypothesis. These issues are load-bearing for the advertised scope, though they may be addressable with additional experiments, adaptive mechanisms, or a narrowed claim.

major comments (4)
  1. [§6, Fig. 29] The central claim is that PAT “infers signed distance to a well-reconstructed surface underlying imperfect observations.” Yet the paper states in Section 6 and shows in Fig. 29 that as sampling density increases from 110k to 29M points, the interior SDF “can paradoxically get worse,” with the hypothesized cause being that fixed k=64 neighborhoods shrink and the network fits “compact tori.” This is a direct failure mode for a major class of inputs—dense point clouds—which are precisely the inputs used in the performance demonstrations (Figs. 16, 20, 21). The paper offers only a hypothesis and future-work suggestions. To support the central claim, the authors must either demonstrate that accuracy is maintained across densities, or provide a mechanism (e.g., density-adaptive k, λ, or subsampling) that makes the method robust, or explicitly narrow the claim to a restricted density range. The
  2. [§4.2, Eq. (25)] Equation (17) is a surface integral with respect to area measure dA. Its discretization in Eq. (25) sums over points without area weights. For non-uniform point clouds—which appear throughout the applications (COLMAP, GLOMAP, uneven sampling in Fig. 22)—omitting area weights biases the exponential average toward densely sampled regions. The paper’s sole justification is the sentence “We hypothesize that we do not observe many ill effects because we fit surfaces with area, rather than singular kernels.” This is an untested hypothesis. Since the method is explicitly aimed at imperfect, non-uniform observations, this is a load-bearing assumption. The authors should either include area weights (computed as in their SSPD baseline) or provide quantitative evidence that their omission does not materially bias the SDF on non-uniform clouds. Without this, the accuracy of the method on real scanne
  3. [§4.3 / §5.2] The network is trained on point clouds of roughly 2048 points with k=64, and the main quantitative evaluation uses 512-point uniformly sampled point clouds. The paper does not report quantitative accuracy as a function of density, noise level, hole size, or topology. The qualitative demonstrations on dense, noisy, and incomplete data are encouraging, but they do not measure error against ground truth. Given that the central claim depends on the pre-trained network’s generalization, the evaluation needs a systematic study: vary sampling density (e.g., 512, 2048, 8k, 64k, 1M), add noise and outliers, and measure SDF error on the same benchmarks. Without such a study, the reader cannot tell whether the method is broadly applicable or only works near the training distribution. The paper’s own Section 6 acknowledges that “predictions might not be robust for point clouds whose sampling charact
  4. [§4.2, lambda heuristic] The paper sets λ via the heuristic λ=10^3/D, where D is the mean distance to the 64 nearest neighbors averaged over the cloud, and then R_eval=2C/λ. This is a global, hand-set rule that is not adapted to local density or noise. Since λ controls the effective blending radius, the same λ may be inappropriate for clouds with varying density or noise (as Fig. 30 suggests). The paper states that “sophisticated tuning” is left to future work. While this is not itself an error, it interacts with the density-generalization problem: a failure at high density could be due to the network, the fixed k, or the λ heuristic, and the current evaluation cannot separate these. At minimum, the authors should report sensitivity of their results to λ and to the choice of k, or provide a principled procedure for setting these parameters on a new cloud. This is needed to make the claimed “fast and parameter-li
minor comments (5)
  1. [§4.2] The relationship between λ_x in Eq. (26) and the heuristic λ=10^3/D used for the radius R_eval is not fully clarified. Are these the same λ used in Eq. (25)? The text jumps between the formula’s shifted exponent and the acceleration heuristic; please define both and state which one is used in the final SDF evaluation.
  2. [Eq. (15)] Equation (15) uses det(∇²φ(x*)) without stating the assumption that x* is a non-degenerate minimizer with positive-definite Hessian. This is standard for Laplace’s method, but a sentence or footnote would help readers apply the formula to Eq. (17).
  3. [Figures 16, 20] The captions for Figures 16 and 20 say “Query: s” with the numeric value apparently missing or lost in formatting. Since query time is a central performance claim, the actual values should appear in the figure or caption.
  4. [Appendix A.1] The open-surface case introduces the ansatz sign_Ω = sign_w. This is a legitimate derivation step, but the main text (Section 2.1) may overstate the validity of the signed Hopf–Cole transformation for open surfaces. Consider adding a forward reference to Appendix A.1 clarifying that this is an assumption, not a theorem, for non-closed geometry.
  5. [§5.2] The evaluation reports mean absolute error on a 64^3 grid. This global average can be dominated by far-field behavior. Reporting near-surface errors (e.g., within a band around the zero set) would better reflect reconstruction quality and SDF usability for offsets and Boolean operations.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the asymptotic derivation is self-contained, and the learned torus fitting is disclosed supervised regression evaluated on held-out data.

full rationale

The paper's claimed derivation chain is not circular. Section 2 derives the self-normalized convolutional formula (Eq. 17) from Green's function and Laplace's method, with the signed Hopf-Cole transformation re-derived in Appendix A and relying on the external result of Lipman (2021) rather than on the present authors' prior work. The algorithm instantiates Eq. 17 with per-point torus SDFs, and the torus parameters are produced by a neural network trained with an explicitly stated loss (Eq. 27) against ground-truth SDFs on ABC and procedurally generated shapes. This is ordinary supervised fitting: the fitted parameters are not calibrated on the evaluation data, and the reported accuracy is measured on held-out shapes (Section 5.2). The paper's own limitation statements (Section 6, Figs. 28–29) acknowledge that predictions may degrade for sampling densities far from the training distribution, and that Eq. 25 omits area weights; these are generalization and approximation concerns, not steps that reduce the output to its inputs by construction. Self-citations such as Feng et al. (2023) for jump harmonic functions and Feng and Crane (2024) as a baseline are contextual and not load-bearing for the central algorithmic claim. Therefore no equation or fitted quantity is equivalent to the claimed result by definition, and the central derivation retains independent mathematical and empirical content.

Assumptions & free parameters 5 free parameters · 6 assumptions · 0 invented entities

The method is not parameter-free: accuracy rests on a supervised network plus several hand-set constants (lambda scale, C, k, loss weights). No new physical entities are introduced; the main domain assumptions are smoothness/local-torus approximability and consistent normals, plus the untested omission of area weights.

free parameters (5)
  • Neural network weights = trained on ~12k shapes (ABC + procedural blobs)
    Predicts the six polynomial coefficients per point; SDF accuracy depends on these learned weights, which are optimized against ground-truth SDF/eikonal loss.
  • lambda scale constant = 1000
    Heuristic lambda = 10^3 / D where D is mean distance to 64 nearest neighbors; controls blend locality and is hand-set. Authors show tuning lambda changes quality (Fig. 30).
  • C (exponent precision constant) = 64
    Used in lambda_x = C / sigma_x and R_eval = 2C / lambda; chosen so exp(-C) underflows in single precision.
  • Neighborhood size k = 64
    Fixed k for network input and D computation; hand-selected; affects torus fitting and lambda.
  • Loss weighting and query sampling = equal distance/eikonal weights; 1/3 uniform, 1/3 narrow band, 1/3 cube
    Training hyperparameters; no systematic sweep reported.
assumptions (6)
  • standard math Laplace's method asymptotic expansion (Eq. 15) with a unique minimizer x*
    Used to claim that as lambda -> infinity the exponential-weighted average selects the closest-point value; this underpins Eqs. 16-17 and Eq. 1.
  • domain assumption Point cloud is sampled from a smooth-enough surface so each local neighborhood is well approximated by a torus (second-order proxy)
    Justifies fitting tori in Section 4.1; fails at sharp features, large holes, very sparse or noisy sampling (acknowledged in Section 6).
  • domain assumption Input point cloud comes with normals that are (mostly) consistently oriented; torus sign follows normal orientation (Eq. 22)
    Sign of each torus SDF and therefore global sign depend on normals; orientation procedure fixes only partially inconsistent normals (Section 5.3).
  • ad hoc to paper Area weights in the discretized surface integral (Eq. 17) can be omitted without materially biasing the SDF
    Section 4.2: 'we omit them for efficiency. We hypothesize that we do not observe many ill effects' - a stated but untested assumption.
  • ad hoc to paper Open-surface ansatz sign_Omega = sign w in the signed Hopf-Cole transformation
    Appendix A.1 extends the derivation to open Omega by assuming sign_Omega equals sign w; needed for the unified theory but not proven for non-closed surfaces.
  • standard math The torus SDF formula in Eq. 23 (distance to the center circle minus minor radius) is the exact signed distance of a solid torus
    Standard result (Quilez 2025); used for every per-point g_i.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Points as Tori: Fast Pointwise Signed Distance for Point Clouds." pith.science (2026). https://pith.science/paper/WTEB4RLO

@misc{pith2026260716946,
  author       = {Pith},
  title        = {Pith review of: Points as Tori: Fast Pointwise Signed Distance for Point Clouds},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WTEB4RLO}},
  note         = {Machine review of arXiv:2607.16946}
}
read the original abstract

We describe a method for computing signed distance to point clouds that allows fast pointwise evaluation at arbitrary spatial resolution. As input, our method takes a point cloud with normals; as output, it provides an analytical parameterization that allows queries of signed distance to the approximate underlying surface at arbitrary points - simultaneously providing reconstruction and distance. Our key idea is to reconstruct shapes by locally fitting point clouds with tori, which have closed-form signed distance functions. Tori are fitted in a feed-forward manner, using a pre-trained network to output per-point curvature and shift parameters. Importantly, our method does not require costly global optimization or spatial discretization, and is easily parallelizable. Underlying our method is a new theory that unifies signed distance with the classic reconstruction methods of winding numbers and Poisson surface reconstruction. We use our method to compute signed distance to point clouds arising from photogrammetry, meshes, 3D Gaussians, and neural implicits. Our method allows point clouds to be used directly in applications, without explicit surface reconstruction: as examples, we take offsets of point clouds, apply morphological and Boolean operations, and directly visualize offset surfaces using sphere tracing.

Figures

Figures reproduced from arXiv: 2607.16946 by the authors.

Figure 1
Figure 1. Given a point cloud, our method directly approximates signed [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 3
Figure 3. Classic point set methods often use a weighted least squares [PITH_FULL_IMAGE:figures/full_fig_p002_3.png] view at source ↗
Figure 4
Figure 4. As screening 𝜆 goes to 0, the solution 𝑤 to Equation 9 converges to a jump harmonic function describing inside-outside (left). As 𝜆 increases, 𝑤 converges to a signed distance function via a log transformation (right). However, this formula works only for closed geometry and fails for sampled geometry like point clouds (Section 2.3). We instead use Equation 17. We likewise consider a signed eikonal equation with vis… view at source ↗
Figures from the paper (19 more)
Figure 5
Figure 5. Figure 5: In naive convolutional distance formulas (Equation 16), the pa [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]
Figure 6
Figure 6. Figure 6: Regularizing the kernel in convolutional distance formulas (Equa [PITH_FULL_IMAGE:figures/full_fig_p004_6.png]
Figure 7
Figure 7. Figure 7: The accuracy of our method improves with sampling quality. Mean [PITH_FULL_IMAGE:figures/full_fig_p005_7.png]
Figure 10
Figure 10. Figure 10: In 2D, our method would use circles to approximate a 1D curve [PITH_FULL_IMAGE:figures/full_fig_p006_10.png]
Figure 11
Figure 11. Figure 11: Madan and Levin [2022] estimate unsigned distance to a [PITH_FULL_IMAGE:figures/full_fig_p006_11.png]
Figure 12
Figure 12. Figure 12: Our method allows directly visualizing surfaces underlying point [PITH_FULL_IMAGE:figures/full_fig_p007_12.png]
Figure 13
Figure 13. Figure 13: We fit the 𝑖th torus so that its equator passes through the point 𝑄∗ 𝑖 (0, 0) given by the polynomial height function at point p𝑖 . The torus’s major and minor radii are aligned with the principal curvatures and direc￾tions of the polynomial surface (Section 4.1). 199…
Figure 15
Figure 15. Figure 15: A neural network is applied to each size- [PITH_FULL_IMAGE:figures/full_fig_p009_15.png]
Figure 16
Figure 16. Figure 16: We visualize some reconstructions produced by our method on dense point cloud outputs from COLMAP. Our method yields reasonable [PITH_FULL_IMAGE:figures/full_fig_p010_16.png]
Figure 17
Figure 17. Figure 17: We visualize reconstructions of several shapes used in our evaluation (Section 5.2). Our method tends to give better results on sparse point clouds, [PITH_FULL_IMAGE:figures/full_fig_p011_17.png]
Figure 18
Figure 18. Figure 18: On average, our method has better signed distance accuracy [PITH_FULL_IMAGE:figures/full_fig_p011_18.png]
Figure 20
Figure 20. Figure 20: We show precompute and query times for point clouds of size [PITH_FULL_IMAGE:figures/full_fig_p012_20.png]
Figure 21
Figure 21. Figure 21: We show reconstructions and slices of the SDF resulting from [PITH_FULL_IMAGE:figures/full_fig_p013_21.png]
Figure 23
Figure 23. Figure 23: We apply Boolean operations to two point clouds (self [PITH_FULL_IMAGE:figures/full_fig_p014_23.png]
Figure 26
Figure 26. Figure 26: General implicit functions can be turned into signed distance [PITH_FULL_IMAGE:figures/full_fig_p014_26.png]
Figure 29
Figure 29. Figure 29: We visualize contoured zero level sets and an SDF slice resulting [PITH_FULL_IMAGE:figures/full_fig_p015_29.png]
Figure 28
Figure 28. Figure 28: Our method was not trained on point clouds with large regions [PITH_FULL_IMAGE:figures/full_fig_p015_28.png]
Figure 30
Figure 30. Figure 30: Though we use a simple, fixed heuristic, further tuning [PITH_FULL_IMAGE:figures/full_fig_p016_30.png]
Figure 31
Figure 31. Figure 31: A few of the analytical SDFs used for evaluation in Section 5.2. [PITH_FULL_IMAGE:figures/full_fig_p024_31.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

297 extracted references · 11 canonical work pages

  1. [1]

    ACM Transactions on Graphics (TOG) , volume=

    Geodesics in heat: A new approach to computing distance based on heat flow , author=. ACM Transactions on Graphics (TOG) , volume=. 2013 , publisher=

    2013

  2. [2]

    ACM Trans

    Sharp, Nicholas and Soliman, Yousuf and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2019 , publisher =

    2019

  3. [3]

    The Discrete Geodesic Problem , author=. SIAM J. Comput. , year=

  4. [4]

    and Hoppe, Hugues , title =

    Surazhsky, Vitaly and Surazhsky, Tatiana and Kirsanov, Danil and Gortler, Steven J. and Hoppe, Hugues , title =. ACM Trans. Graph. , month = jul, pages =. 2005 , issue_date =. doi:10.1145/1073204.1073228 , abstract =

    arXiv 2005

  5. [5]

    , author =

    Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes. , author =. VMV , year =

  6. [6]

    ACM Trans

    Sharp, Nicholas and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2020 , publisher =

    2020

  7. [7]

    Computer Graphics Forum , title =

    Stein, Oded and Wardetzky, Max and Jacobson, Alec and Grinspun, Eitan , year =. Computer Graphics Forum , title =

  8. [8]

    Computer Graphics Forum , volume=

    SSD: Smooth Signed Distance Surface Reconstruction , author=. Computer Graphics Forum , volume=. 2011 , organization=

    2011

Show all 297 references
  1. [9]

    Proceedings of the National Academy of Sciences , volume =

    James A Sethian , title =. Proceedings of the National Academy of Sciences , volume =. 1996 , doi =. https://www.pnas.org/doi/pdf/10.1073/pnas.93.4.1591 , abstract =

    1996 doi

  2. [10]

    ACM Trans

    Alec Jacobson and Ladislav Kavan and Olga Sorkine , title =. ACM Trans. Graph. , volume =

  3. [11]

    1990 , publisher=

    Kravtsov, Yury Aleksandrovich and Orlov, Yury Ilich , volume=. 1990 , publisher=

    1990

  4. [12]

    2018 , journal =

    Fast Winding Numbers for Soups and Clouds , author =. 2018 , journal =

    2018

  5. [13]

    and Cohen-Steiner, D

    Alliez, P. and Cohen-Steiner, D. and Tong, Y. and Desbrun, M. , title =. Proceedings of the Fifth Eurographics Symposium on Geometry Processing , pages =. 2007 , isbn =

    2007

  6. [14]

    Computer Graphics Forum , volume =

    Mullen, Patrick and De Goes, Fernando and Desbrun, Mathieu and Cohen-Steiner, David and Alliez, Pierre , title =. Computer Graphics Forum , volume =. doi:10.1111/j.1467-8659.2010.01782.x , year =

    2010

  7. [15]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

    Park, Jeong Joon and Florence, Peter and Straub, Julian and Newcombe, Richard and Lovegrove, Steven , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

  8. [16]

    CoRR , volume =

    Amos Gropp and Lior Yariv and Niv Haim and Matan Atzmon and Yaron Lipman , title =. CoRR , volume =. 2020 , url =. 2002.10099 , timestamp =

    2020 arXiv

  9. [17]

    1992 , issue_date =

    Hoppe, Hugues and DeRose, Tony and Duchamp, Tom and McDonald, John and Stuetzle, Werner , title =. 1992 , issue_date =. doi:10.1145/142920.134011 , journal =

    1992

  10. [18]

    1997 , issn =

    Extraction of Shape Skeletons from Grayscale Images , journal =. 1997 , issn =. doi:10.1006/cviu.1997.0612 , author =

    1997

  11. [19]

    1996 , isbn =

    Curless, Brian and Levoy, Marc , title =. 1996 , isbn =. doi:10.1145/237170.237269 , booktitle =

    1996

  12. [20]

    Discrete Quadratic Curvature Energies , year =

    Wardetzky, Max and Bergou, Mikl\'. Discrete Quadratic Curvature Energies , year =. Comput. Aided Geom. Des. , month =. doi:10.1016/j.cagd.2007.07.006 , abstract =

    2007 doi

  13. [21]

    Identifying Vector Field Singularities Using a Discrete Hodge Decomposition

    Polthier, Konrad and Preu , Eike. Identifying Vector Field Singularities Using a Discrete Hodge Decomposition. Visualization and Mathematics III. 2003

    2003

  14. [22]

    ACM Trans

    Stein, Oded and Grinspun, Eitan and Wardetzky, Max and Jacobson, Alec , title =. ACM Trans. Graph. , issue_date =. 2018 , issn =. doi:10.1145/3186564 , acmid =

    2018 doi

  15. [23]

    ACM Trans

    Metzer, Gal and Hanocka, Rana and Zorin, Denis and Giryes, Raja and Panozzo, Daniele and Cohen-Or, Daniel , title =. ACM Trans. Graph. , month =. 2021 , issue_date =. doi:10.1145/3450626.3459835 , abstract =

    2021

  16. [24]

    Alec Jacobson and Daniele Panozzo and others , note =

  17. [25]

    CGAL User and Reference Manual

    The CGAL Project. CGAL User and Reference Manual

  18. [26]

    Anderson and J

    R. Anderson and J. Andrej and A. Barker and J. Bramwell and J.-S. Camier and J. Cerveny V. Dobrev and Y. Dudouit and A. Fisher and Tz. Kolev and W. Pazner and M. Stowell and V. Tomov and I. Akkerman and J. Dahm and D. Medina and S. Zampini , journal =. doi:10.1016/j.camwa.2020...

    2020 doi

  19. [27]

    CoRR , volume =

    Matan Atzmon and Yaron Lipman , title =. CoRR , volume =. 2019 , url =. 1911.10414 , timestamp =

    2019 arXiv

  20. [28]

    2020 , eprint=

    SALD: Sign Agnostic Learning with Derivatives , author=. 2020 , eprint=

    2020

  21. [29]

    , author=

    A fast marching level set method for monotonically advancing fronts. , author=. proceedings of the National Academy of Sciences , volume=. 1996 , publisher=

    1996

  22. [30]

    ACM Trans

    Kazhdan, Michael and Hoppe, Hugues , title =. ACM Trans. Graph. , month =. 2013 , issue_date =. doi:10.1145/2487228.2487237 , abstract =

    2013

  23. [31]

    and Beatson, Rick K

    Carr, Jonathan C. and Beatson, Rick K. and Cherrie, J. B. and Mitchell, T. J. and Fright, W Richard and McCallum, Bruce C. and Evans, T. R. , title =. Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques , pages =. 2001 , isbn =. doi:10.114...

    2001

  24. [32]

    , title =

    Blinn, James F. , title =. 1982 , issue_date =. doi:10.1145/357306.357310 , journal =

    1982

  25. [33]

    Variational implicit surfaces , author=

  26. [35]

    ACM SIGGRAPH 2005 Courses , pages =

    Ohtake, Yutaka and Belyaev, Alexander and Alexa, Marc and Turk, Greg and Seidel, Hans-Peter , title =. ACM SIGGRAPH 2005 Courses , pages =. 2005 , isbn =. doi:10.1145/1198555.1198649 , abstract =

    2005

  27. [36]

    A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions , year=

    Ohtake, Yutaka and Belyaev, Alexander and Seidel, Hans-Peter , booktitle=. A multi-scale approach to 3D scattered data interpolation with compactly supported basis functions , year=

  28. [37]

    ACM Trans

    Huang, Zhiyang and Carr, Nathan and Ju, Tao , title =. ACM Trans. Graph. , month =. 2019 , issue_date =. doi:10.1145/3306346.3322994 , abstract =

    2019

  29. [38]

    2023 , issue_date =

    Feng, Nicole and Gillespie, Mark and Crane, Keenan , title =. 2023 , issue_date =. doi:10.1145/3592401 , journal =

    2023 doi

  30. [40]

    IEEE Transactions on Visualization and Computer Graphics , year =

    Mancinelli, Claudio and Nazzaro, Giacomo and Pellacini, Fabio and Puppo, Enrico , title =. IEEE Transactions on Visualization and Computer Graphics , year =

  31. [41]

    ACM Transactions on Graphics , year =

    Nazzaro, Giacomo and Puppo, Enrico and Pellacini, Fabio , title =. ACM Transactions on Graphics , year =

  32. [42]

    DGtal: Digital Geometry tools and algorithms library , author =

  33. [43]

    VolGallery , author =

  34. [44]

    Heat Kernels and Dirac Operators , year =

    Berline, Nicole and Getzler, Ezra and Vergne, Mich\`. Heat Kernels and Dirac Operators , year =

  35. [45]

    ACM Trans

    Sawhney, Rohan and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2020 , publisher =

    2020

  36. [46]

    ACM Trans

    Sawhney, Rohan and Seyb, Dario and Jarosz, Wojciech and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2022 , publisher =

    2022

  37. [47]

    ACM Trans

    Miller, Bailey and Sawhney, Rohan and Crane, Keenan and Gkioulekas, Ioannis , title =. ACM Trans. Graph. , volume =. 2023 , publisher =

    2023

  38. [48]

    ACM Trans

    Sawhney, Rohan and Miller, Bailey and Gkioulekas, Ioannis and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2023 , publisher =

    2023

  39. [49]

    ACM Trans

    A Practical Walk-on-Boundary Method for Boundary Value Problems , author =. ACM Trans. Graph. , month =. 2023 , issue_date =

    2023

  40. [50]

    Coifman and St\'

    Ronald R. Coifman and St\'. Diffusion maps , journal =. 2006 , note =. doi:10.1016/j.acha.2006.04.006 , url =

    2006 doi

  41. [51]

    Computer Graphics Forum , volume =

    Herholz, Philipp and Alexa, Marc , title =. Computer Graphics Forum , volume =. doi:10.1111/cgf.13607 , year =

    doi

  42. [52]

    arXiv e-prints , keywords =

    A Survey of Algorithms for Geodesic Paths and Distances. arXiv e-prints , keywords =

  43. [53]

    ACM Trans

    Gillespie, Mark and Sharp, Nicholas and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2021 , publisher =

    2021

  44. [54]

    ACM Trans

    Liu, Hsueh-Ti Derek and Gillespie, Mark and Chislett, Benjamin and Sharp, Nicholas and Jacobson, Alec and Crane, Keenan , title =. ACM Trans. Graph. , volume =. 2023 , publisher =. doi:10.1145/3592403 , month =

    2023 doi

  45. [55]

    Journal of computational physics , volume=

    A variational level set approach to multiphase motion , author=. Journal of computational physics , volume=. 1996 , publisher=

    1996

  46. [56]

    ACM SIGGRAPH 2023 Conference Proceedings , articleno =

    Edelstein, Michal and Guillen, Nestor and Solomon, Justin and Ben-Chen, Mirela , title =. ACM SIGGRAPH 2023 Conference Proceedings , articleno =. 2023 , isbn =. doi:10.1145/3588432.3591523 , abstract =

    2023

  47. [57]

    doi:10.1145/3592109 , url =

    Ryusuke Sugimoto and Terry Chen and Yiti Jiang and Christopher Batty and Toshiya Hachisuka , title =. doi:10.1145/3592109 , url =

    doi

  48. [58]

    2004 , publisher =

    Theory and Practice of Finite Elements , author =. 2004 , publisher =. doi:10.1007/978-1-4757-4355-5 , edition =

    2004 doi

  49. [59]

    Linear Subspace Design for Real-Time Shape Deformation , year =

    Wang, Yu and Jacobson, Alec and Barbi. Linear Subspace Design for Real-Time Shape Deformation , year =. ACM Trans. Graph. , month =. doi:10.1145/2766952 , abstract =

    doi

  50. [60]

    2015 , title =

    Wang, Yu and Jacobson, Alec and Barbi. 2015 , title =

    2015

  51. [61]

    Vega FEM Library

    Jernej Barbi c and Fun Shing Sin and Daniel Schroeder. Vega FEM Library. 2012

    2012

  52. [62]

    SSD Surface Reconstruction (Version 3.0) , author =

  53. [63]

    Biharmonic Distance

    Yaron Lipman and Raif Rustamov and Thomas Funkhouser. Biharmonic Distance. ACM Transactions on Graphics. 2010

    2010

  54. [65]

    Stochastic Poisson Surface Reconstruction , year =

    Sell. Stochastic Poisson Surface Reconstruction , year =. ACM Trans. Graph. , month =. doi:10.1145/3550454.3555441 , abstract =

  55. [66]

    ACM SIGGRAPH 2016 courses , series =

    De Goes, Fernando and Desbrun, Mathieu and Tong, Yiying , title =. ACM SIGGRAPH 2016 courses , series =. 2016 , publisher =

    2016

  56. [67]

    Discrete Differential Operators on Polyhedral Surfaces -- Convergence and Approximation , year =

    Wardetzky, Max , advisor =. Discrete Differential Operators on Polyhedral Surfaces -- Convergence and Approximation , year =

  57. [68]

    ACM Trans

    Liu, Beibei and Tong, Yiying and Goes, Fernando De and Desbrun, Mathieu , title =. ACM Trans. Graph. , month =. 2016 , issue_date =. doi:10.1145/2870629 , abstract =

    2016 doi

  58. [69]

    2020 , journal =

    Belyaev, Alexander and Fayolle, Pierre-Alain , title =. 2020 , journal =

    2020

  59. [70]

    2020 , eprint=

    Neural Unsigned Distance Fields for Implicit Function Learning , author=. 2020 , eprint=

    2020

  60. [71]

    Computer Graphics Forum , volume =

    Bunge, Astrid and Herholz, Philipp and Kazhdan, Misha and Botsch, Mario , title =. Computer Graphics Forum , volume =. doi:10.1111/cgf.13931 , year =

    doi

  61. [72]

    Caissard, Thomas and Coeurjolly, David and Lachaud, Jacques-Olivier and Roussillon, Tristan , title =. J. Math. Imaging Vis. , month =. 2019 , issue_date =. doi:10.1007/s10851-018-0839-4 , abstract =

    2019 doi

  62. [73]

    A Simple Discrete Calculus for Digital Surfaces , year =

    David Coeurjolly and Jacques-Olivier Lachaud , booktitle =. A Simple Discrete Calculus for Digital Surfaces , year =

  63. [74]

    ACM Trans

    De Goes, Fernando and Butts, Andrew and Desbrun, Mathieu , title =. ACM Trans. Graph. , month =. 2020 , issue_date =. doi:10.1145/3386569.3392389 , abstract =

    2020

  64. [75]

    ACM Trans

    de Goes, Fernando and Desbrun, Mathieu and Meyer, Mark and DeRose, Tony , title =. ACM Trans. Graph. , month =. 2016 , issue_date =. doi:10.1145/2897824.2925880 , abstract =

    2016

  65. [76]

    Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow , year =

    Desbrun, Mathieu and Meyer, Mark and Schr\". Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow , year =. Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques , pages =. doi:10.1145/311535.311576 , abstract =

  66. [77]

    arXiv:1602.02481 , year =

    Sungjoon Choi and Qian-Yi Zhou and Stephen Miller and Vladlen Koltun , title =. arXiv:1602.02481 , year =

    arXiv

  67. [78]

    Constructive Solid Geometry on Neural Signed Distance Fields , year =

    Marschner, Zo\". Constructive Solid Geometry on Neural Signed Distance Fields , year =. SIGGRAPH Asia 2023 Conference Papers , articleno =

    2023

  68. [79]

    arXiv preprint arXiv:2312.09222 , year=

    Mosaic-SDF for 3D Generative Models , author=. arXiv preprint arXiv:2312.09222 , year=

    arXiv

  69. [80]

    Differentiable Signed Distance Function Rendering , journal =

    Delio Vicini and S\'. Differentiable Signed Distance Function Rendering , journal =. 2022 , month = jul, doi =

    2022

  70. [81]

    How to make a blob in 3D? , publisher =

    user484 , howpublished =. How to make a blob in 3D? , publisher =

  71. [82]

    GitHub repository , howpublished =

    Casey Duncan , title =. GitHub repository , howpublished =. 2018 , publisher =

    2018

  72. [83]

    3D distance and gradient functions - 2025 , author =

    2025

  73. [84]

    2D distance and gradient functions - 2019 , author =

    2019

  74. [85]

    distance functions , author =

  75. [86]

    Raymarching Signed Distance Fields , author =

  76. [87]

    Level set methods and dynamic implicit surfaces , author=. Appl. Mech. Rev. , volume=

  77. [88]

    Proceedings of the 29th annual conference on Computer graphics and interactive techniques , pages=

    Level set surface editing operators , author=. Proceedings of the 29th annual conference on Computer graphics and interactive techniques , pages=

  78. [89]

    RSS 2016 workshop: geometry and beyond-representations, physics, and scene understanding for robotics , year=

    Signed distance fields: A natural representation for both mapping and planning , author=. RSS 2016 workshop: geometry and beyond-representations, physics, and scene understanding for robotics , year=

    2016

  79. [90]

    SIAM review , volume=

    Fast marching methods , author=. SIAM review , volume=. 1999 , publisher=

    1999

  80. [91]

    Proceedings of the national academy of Sciences , volume=

    Computing geodesic paths on manifolds , author=. Proceedings of the national academy of Sciences , volume=. 1998 , publisher=

    1998

  81. [92]

    Seminal graphics: pioneering efforts that shaped the field , pages=

    Marching cubes: A high resolution 3D surface construction algorithm , author=. Seminal graphics: pioneering efforts that shaped the field , pages=

  82. [93]

    FCPW: Fastest Closest Points in the West , author=

  83. [94]

    , author=

    Point in Polygon Strategies. , author=. Graphics Gems , volume=

  84. [95]

    2023 , journal=

    Perspectives on Winding Numbers , author=. 2023 , journal=

    2023

  85. [96]

    2024 , issue_date =

    Feng, Nicole and Crane, Keenan , title =. 2024 , issue_date =. doi:10.1145/3658220 , journal =

    2024 doi

  86. [97]

    , author=

    Tetrahedral meshing in the wild. , author=. ACM Trans. Graph. , volume=

  87. [98]

    Computer graphics forum , volume=

    Geodesic distance computation via virtual source propagation , author=. Computer graphics forum , volume=. 2021 , organization=

    2021

  88. [99]

    The Visual Computer , volume=

    Sphere tracing: A geometric method for the antialiased ray tracing of implicit surfaces , author=. The Visual Computer , volume=. 1996 , publisher=

    1996

  89. [100]

    1963 , publisher=

    Linear programming and extensions , author=. 1963 , publisher=

    1963

  90. [101]

    Fourth International Workshop on Volume Graphics, 2005

    Robust generation of signed distance fields from triangle meshes , author=. Fourth International Workshop on Volume Graphics, 2005. , pages=. 2005 , organization=

    2005

  91. [102]

    IEEE transactions on pattern analysis and machine intelligence , volume=

    Parallel and scalable heat methods for geodesic distance computation , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2019 , publisher=

    2019

  92. [103]

    Computer-Aided Design , volume=

    Signed Lp-distance fields , author=. Computer-Aided Design , volume=. 2013 , publisher=

    2013

  93. [104]

    CNNs on Surfaces using Rotation-Equivariant Features , year =

    Ruben Wiersma, Elmar Eisemann, Klaus Hildebrandt , journal =. CNNs on Surfaces using Rotation-Equivariant Features , year =. doi:10.1145/3386569.3392437 , publisher =

  94. [105]

    Multimedia Tools and Applications , volume=

    Heat method of non-uniform diffusion for computing geodesic distance on images and surfaces , author=. Multimedia Tools and Applications , volume=. 2022 , publisher=

    2022

  95. [106]

    2022 IEEE 9th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON) , pages=

    Enhanced Heat Method for Computation of Geodesic Distance on Triangular Meshes , author=. 2022 IEEE 9th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON) , pages=. 2022 , organization=

    2022

  96. [107]

    2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI) , pages=

    Modified Heat Method using GMRES for Geodesic Distance , author=. 2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI) , pages=. 2022 , organization=

    2022

  97. [108]

    2004 , issn =

    Approximate distance fields with non-vanishing gradients , journal =. 2004 , issn =. doi:10.1016/j.gmod.2004.01.003 , author =

    2004 doi

  98. [109]

    2016 Fourth International Conference on 3D Vision (3DV) , pages=

    Spectrometer: Amortized sublinear spectral approximation of distance on graphs , author=. 2016 Fourth International Conference on 3D Vision (3DV) , pages=. 2016 , organization=

    2016

  99. [110]

    2020 , issue_date =

    Stein, Oded and Jacobson, Alec and Wardetzky, Max and Grinspun, Eitan , title =. 2020 , issue_date =. doi:10.1145/3377406 , journal =

    2020 doi

  100. [111]

    Eigen v3 , howpublished =

    Ga\". Eigen v3 , howpublished =

  101. [112]

    2011 , journal =

    Chambolle, Antonin and Pock, Thomas , title =. 2011 , journal =. doi:10.1007/s10851-010-0251-1 , volume =

    2011 doi

  102. [113]

    2019 , publisher=

    Algorithms , author=. 2019 , publisher=

    2019

  103. [114]

    ACM Trans

    Wang, Stephanie and Chern, Albert , title =. ACM Trans. Graph. , issue_date =. 2021 , pages =. doi:10.1145/3450626.3459781 , publisher =

    2021

  104. [115]

    Palmer, David and Smirnov, Dmitriy and Wang, Stephanie and Chern, Albert and Solomon, Justin , year=

  105. [116]

    Deep Accurate Solver for the Geodesic Problem

    Huberman, Saar and Bracha, Amit and Kimmel, Ron. Deep Accurate Solver for the Geodesic Problem. Scale Space and Variational Methods in Computer Vision. 2023

    2023

  106. [117]

    Deep Eikonal Solvers

    Lichtenstein, Moshe and Pai, Gautam and Kimmel, Ron. Deep Eikonal Solvers. Scale Space and Variational Methods in Computer Vision. 2019

    2019

  107. [118]

    International Conference on Scale Space and Variational Methods in Computer Vision , pages=

    Deep Accurate Solver for the Geodesic Problem , author=. International Conference on Scale Space and Variational Methods in Computer Vision , pages=. 2023 , organization=

    2023

  108. [119]

    Scale Space and Variational Methods in Computer Vision: 7th International Conference, SSVM 2019, Hofgeismar, Germany, June 30--July 4, 2019, Proceedings 7 , pages=

    Deep eikonal solvers , author=. Scale Space and Variational Methods in Computer Vision: 7th International Conference, SSVM 2019, Hofgeismar, Germany, June 30--July 4, 2019, Proceedings 7 , pages=. 2019 , organization=

    2019

  109. [120]

    Operators on Riemannian Manifolds: Hodge Laplacian, Laplace-Beltrami Laplacian, the Bochner Laplacian, and Weitzenb

    Gallier, Jean and Quaintance, Jocelyn and Gallier, Jean and Quaintance, Jocelyn , journal=. Operators on Riemannian Manifolds: Hodge Laplacian, Laplace-Beltrami Laplacian, the Bochner Laplacian, and Weitzenb. 2020 , publisher=

    2020

  110. [121]

    ACM Siggraph Course , volume=

    Discrete differential geometry: an applied introduction , author=. ACM Siggraph Course , volume=

  111. [122]

    Computer Graphics Forum , title =

    Alexa, Marc and Herholz, Philipp and Kohlbrenner, Max and Sorkine-Hornung, Olga , year =. Computer Graphics Forum , title =

  112. [123]

    , title =

    Garland, Michael and Heckbert, Paul S. , title =. Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques , pages =. 1997 , isbn =. doi:10.1145/258734.258849 , abstract =

    1997

  113. [124]

    ACM Trans

    Myles, Ashish and Pietroni, Nico and Zorin, Denis , title =. ACM Trans. Graph. , month =. 2014 , issue_date =. doi:10.1145/2601097.2601154 , abstract =

    2014

  114. [125]

    1987 , month =

    Loop, Charles , title =. 1987 , month =

    1987

  115. [126]

    ACM SIGGRAPH 2010 Courses , pages=

    Spectral mesh processing , author=. ACM SIGGRAPH 2010 Courses , pages=

    2010

  116. [127]

    2016 , school=

    Tangent Vector Fields on Triangulated Surfaces-An Edge-Based Approach , author=. 2016 , school=

    2016

  117. [128]

    ACM SIGGRAPH 2013 Courses , pages=

    Digital geometry processing with discrete exterior calculus , author=. ACM SIGGRAPH 2013 Courses , pages=

    2013

  118. [129]

    1949 , school=

    The solution of partial differential equations by means of electrical networks , author=. 1949 , school=

    1949

  119. [130]

    Tohoku Mathematical Journal, Second Series , volume=

    The dimension of a cut locus on a smooth Riemannian manifold , author=. Tohoku Mathematical Journal, Second Series , volume=. 1998 , publisher=

    1998

  120. [131]

    2000 , publisher=

    Calculus of variations , author=. 2000 , publisher=

    2000

  121. [132]

    ACM Trans

    TetGen, a Delaunay-based quality tetrahedral mesh generator , author=. ACM Trans. Math. Softw , volume=

  122. [133]

    Computer Vision and Image Understanding , volume=

    Multigrid convergent principal curvature estimators in digital geometry , author=. Computer Vision and Image Understanding , volume=. 2014 , publisher=

    2014

  123. [134]

    nature , volume=

    A hierarchical O (N log N) force-calculation algorithm , author=. nature , volume=. 1986 , publisher=

    1986

  124. [135]

    1984 , publisher=

    Boundary Element Techniques: Theory and Applications in Engineering , author=. 1984 , publisher=

    1984

  125. [136]

    2008 , publisher=

    Boundary Integral Equations , author=. 2008 , publisher=

    2008

  126. [137]

    2022 , issue_date =

    Sharp, Nicholas and Jacobson, Alec , title =. 2022 , issue_date =. doi:10.1145/3528223.3530155 , journal =

    2022

  127. [138]

    Computer Graphics Forum , year=

    Uniform Sampling of Surfaces by Casting Rays , author=. Computer Graphics Forum , year=

  128. [139]

    2021 , eprint=

    Phase Transitions, Distance Functions, and Implicit Neural Representations , author=. 2021 , eprint=

    2021

  129. [140]

    Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year=

    Learning Implicit Fields for Generative Shape Modeling , author=. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , year=

  130. [141]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

    Mescheder, Lars and Oechsle, Michael and Niemeyer, Michael and Nowozin, Sebastian and Geiger, Andreas , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , month =

  131. [142]

    ACM Trans

    Robust inside-outside segmentation using generalized winding numbers , author=. ACM Trans. Graph. , year=

  132. [143]

    2024 , booktitle =

    Gotsman, Craig and Hormann, Kai , title =. 2024 , booktitle =

    2024

  133. [144]

    2024 , journal =

    Chen, Jiong and Schaefer, Florian and Desbrun, Mathieu , title =. 2024 , journal =

    2024

  134. [145]

    2024 , issue_date =

    Chen, Hanyu and Miller, Bailey and Gkioulekas, Ioannis , title =. 2024 , issue_date =. doi:10.1145/3687914 , journal =

    2024 doi

  135. [146]

    Computer Graphics Forum , pages=

    1-Lipschitz Neural Distance Fields , author=. Computer Graphics Forum , pages=. 2024 , organization=

    2024

  136. [147]

    1995 , publisher=

    Introduction to partial differential equations , author=. 1995 , publisher=

    1995

  137. [148]

    European Conference on Computer Vision , year=

    Pixelwise view selection for unstructured multi-view stereo , author=. European Conference on Computer Vision , year=

  138. [149]

    Structure-from-Motion Revisited , booktitle=

    Sch\". Structure-from-Motion Revisited , booktitle=

  139. [150]

    ACM Trans

    Gillespie, Mark and Yang, Denise and Botsch, Mario and Crane, Keenan , title =. ACM Trans. Graph. , year =

  140. [151]

    2017 , publisher=

    Generalized barycentric coordinates in computer graphics and computational mechanics , author=. 2017 , publisher=

    2017

  141. [152]

    ACM Trans

    Radiative backpropagation: An adjoint method for lightning-fast differentiable rendering , author=. ACM Trans. Graph. , year=

  142. [153]

    Computer Graphics Forum , volume=

    On variational and PDE-based distance function approximations , author=. Computer Graphics Forum , volume=. 2015 , organization=

    2015

  143. [154]

    ACM Trans

    Path replay backpropagation: Differentiating light paths using constant memory and linear time , author=. ACM Trans. Graph. , year=

  144. [155]

    arXiv preprint arXiv:2006.15059 , year=

    Computing Light Transport Gradients using the Adjoint Method , author=. arXiv preprint arXiv:2006.15059 , year=

    2006 arXiv

  145. [156]

    ACM SIGGRAPH Asia Conference Papers , year=

    Differentiable rendering of neural sdfs through reparameterization , author=. ACM SIGGRAPH Asia Conference Papers , year=

  146. [157]

    ACM Trans

    Differentiable signed distance function rendering , author=. ACM Trans. Graph. , year=

  147. [158]

    Computer Graphics Forum , year=

    Unified shape and svbrdf recovery using differentiable monte carlo rendering , author=. Computer Graphics Forum , year=

  148. [159]

    Advances in neural information processing systems , volume=

    Pytorch: An imperative style, high-performance deep learning library , author=. Advances in neural information processing systems , volume=

  149. [160]

    Computer Graphics Forum , year=

    Physics-based inverse rendering using combined implicit and explicit geometries , author=. Computer Graphics Forum , year=

  150. [161]

    ACM Trans

    Spatiotemporal reservoir resampling for real-time ray tracing with dynamic direct lighting , author=. ACM Trans. Graph. , year=

  151. [162]

    2023 , publisher=

    Physically based rendering: From theory to implementation , author=. 2023 , publisher=

    2023

  152. [163]

    ACM Trans

    Embree: a kernel framework for efficient CPU ray tracing , author=. ACM Trans. Graph. , year=

  153. [164]

    Automatic differentiation in pytorch , author=

  154. [165]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Infonerf: Ray entropy minimization for few-shot neural volume rendering , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  155. [166]

    2005 , journal =

    Ju, Tao and Schaefer, Scott and Warren, Joe , title =. 2005 , journal =

    2005

  156. [167]

    Computer Aided Geometric Design , year=

    Mean value coordinates in 3D , author=. Computer Aided Geometric Design , year=

  157. [168]

    Proceedings of the 19th annual conference on computer graphics and interactive techniques , year=

    Surface reconstruction from unorganized points , author=. Proceedings of the 19th annual conference on computer graphics and interactive techniques , year=

  158. [169]

    Communications in Computational Physics , year=

    A simple method for computing singular or nearly singular integrals on closed surfaces , author=. Communications in Computational Physics , year=

  159. [170]

    SIAM Journal on Numerical Analysis , volume=

    A method for computing nearly singular integrals , author=. SIAM Journal on Numerical Analysis , volume=. 2001 , publisher=

    2001

  160. [171]

    ACM Transactions on Graphics (TOG) , volume=

    Robust Containment Queries over Collections of Rational Parametric Curves via Generalized Winding Numbers , author=. ACM Transactions on Graphics (TOG) , volume=. 2024 , publisher=

    2024

  161. [172]

    ACM Transactions on Graphics (TOG) , volume=

    Regularized kelvinlets: sculpting brushes based on fundamental solutions of elasticity , author=. ACM Transactions on Graphics (TOG) , volume=. 2017 , publisher=

    2017

  162. [173]

    Journal of Computational Physics , volume=

    Contributions to vortex particle methods for the computation of three-dimensional incompressible unsteady flows , author=. Journal of Computational Physics , volume=. 1993 , publisher=

    1993

  163. [174]

    Journal of Computational Physics , volume=

    Quadrature by expansion: A new method for the evaluation of layer potentials , author=. Journal of Computational Physics , volume=. 2013 , publisher=

    2013

  164. [175]

    Trends and advances , pages=

    Vortex methods: An introduction and survey of selected research topics, Incompressible computational fluid dvnamics , author=. Trends and advances , pages=. 1993 , publisher=

    1993

  165. [176]

    SIAM Journal on Scientific Computing , year=

    The method of regularized Stokeslets , author=. SIAM Journal on Scientific Computing , year=

  166. [177]

    Physics of Fluids , year=

    The method of regularized Stokeslets in three dimensions: analysis, validation, and application to helical swimming , author=. Physics of Fluids , year=

  167. [178]

    2024 , booktitle =

    Huang, Binbin and Yu, Zehao and Chen, Anpei and Geiger, Andreas and Gao, Shenghua , title =. 2024 , booktitle =

    2024

  168. [179]

    European Conference on Computer Vision , year=

    Approximate differentiable rendering with algebraic surfaces , author=. European Conference on Computer Vision , year=

  169. [180]

    arXiv preprint arXiv:2404.10772 , year=

    Gaussian opacity fields: Efficient and compact surface reconstruction in unbounded scenes , author=. arXiv preprint arXiv:2404.10772 , year=

    arXiv

  170. [181]

    Computer graphics and image processing , year=

    Geometric modeling using octree encoding , author=. Computer graphics and image processing , year=

  171. [182]

    European Conference on Computer Vision , year=

    Shading-aware multi-view stereo , author=. European Conference on Computer Vision , year=

  172. [183]

    ACM Trans

    Bundlefusion: Real-time globally consistent 3d reconstruction using on-the-fly surface reintegration , author=. ACM Trans. Graph. , year=

  173. [184]

    ACM SIGGRAPH courses , year=

    OpenVDB: an open-source data structure and toolkit for high-resolution volumes , author=. ACM SIGGRAPH courses , year=

  174. [185]

    ACM Trans

    Shading-based refinement on volumetric signed distance functions , author=. ACM Trans. Graph. , year=

  175. [186]

    Computer Graphics Forum , year=

    Advances in neural rendering , author=. Computer Graphics Forum , year=

  176. [187]

    IEEE Conference on Computer Vision and Pattern Recognition , year=

    High-quality shape from multi-view stereo and shading under general illumination , author=. IEEE Conference on Computer Vision and Pattern Recognition , year=

  177. [188]

    Acta Numerica , year=

    A survey of structure from motion , author=. Acta Numerica , year=

  178. [189]

    Communications of the ACM , year=

    Building rome in a day , author=. Communications of the ACM , year=

  179. [190]

    arXiv preprint arXiv:2311.12775 , year=

    SuGaR: Surface-Aligned Gaussian Splatting for Efficient 3D Mesh Reconstruction and High-Quality Mesh Rendering , author=. arXiv preprint arXiv:2311.12775 , year=

    arXiv

  180. [191]

    ACM SIGGRAPH papers , year=

    Photo tourism: exploring photo collections in 3D , author=. ACM SIGGRAPH papers , year=

  181. [192]

    International journal of computer vision , year=

    Modeling the world from internet photo collections , author=. International journal of computer vision , year=

  182. [193]

    2003 , publisher=

    Multiple view geometry in computer vision , author=. 2003 , publisher=

    2003

  183. [194]

    Proceedings of the Royal Society of London

    The interpretation of structure from motion , author=. Proceedings of the Royal Society of London. Series B. Biological Sciences , year=

  184. [195]

    Proceedings of the DARPA Image Understanding Workshop , year=

    Shape and motion without depth , author=. Proceedings of the DARPA Image Understanding Workshop , year=

  185. [196]

    Computer-Aided Design , year=

    Signed Lp-distance fields , author=. Computer-Aided Design , year=

  186. [197]

    ACM SIGGRAPH Conference Proceedings , year=

    Learning smooth neural functions via lipschitz regularization , author=. ACM SIGGRAPH Conference Proceedings , year=

  187. [198]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year =

    Miller, Bailey and Chen, Hanyu and Lai, Alice and Gkioulekas, Ioannis , title =. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year =

  188. [199]

    Workshop on applied computational geometry , pages=

    Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator , author=. Workshop on applied computational geometry , pages=. 1996 , organization=

    1996

  189. [200]

    2025 , eprint=

    LiSu: A Dataset and Method for LiDAR Surface Normal Estimation , author=. 2025 , eprint=

    2025

  190. [201]

    International Workshop on Artificial Neural Networks , year=

    The influence of the sigmoid function parameters on the speed of backpropagation learning , author=. International Workshop on Artificial Neural Networks , year=

  191. [202]

    ACM Transactions on Graphics (TOG) , volume=

    A Heat Method for Generalized Signed Distance , author=. ACM Transactions on Graphics (TOG) , volume=. 2024 , publisher=

    2024

  192. [203]

    ACM Trans

    Fast winding numbers for soups and clouds , author=. ACM Trans. Graph. , volume=. 2018 , publisher=

    2018

  193. [204]

    ACM Trans

    Winding Numbers on Discrete Surfaces , author=. ACM Trans. Graph. , year=

  194. [205]

    Srinivasan and Peter Hedman and Ricardo Martin-Brualla and Jonathan T

    Ben Mildenhall and Dor Verbin and Pratul P. Srinivasan and Peter Hedman and Ricardo Martin-Brualla and Jonathan T. Barron , year=

  195. [206]

    2024 , journal =

    de Goes, Fernando and Desbrun, Mathieu , title =. 2024 , journal =

    2024

  196. [207]

    Advances in Neural Information Processing Systems , year=

    Shape as points: A differentiable poisson solver , author=. Advances in Neural Information Processing Systems , year=

  197. [208]

    Eurographics State of the Art Reports , year=

    State of the art in surface reconstruction from point clouds , author=. Eurographics State of the Art Reports , year=

  198. [209]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Depth-supervised nerf: Fewer views and faster training for free , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  199. [210]

    1998 , publisher=

    Inverse rendering for computer graphics , author=. 1998 , publisher=

    1998

  200. [211]

    Communications on Pure and Applied Mathematics , volume=

    On the behavior of the fundamental solution of the heat equation with variable coefficients , author=. Communications on Pure and Applied Mathematics , volume=. 1967 , publisher=

    1967

  201. [212]

    and Rangarajan, Anand

    Gurumoorthy, Karthik S. and Rangarajan, Anand. A Schr \"o dinger Equation for the Fast Computation of Approximate Euclidean Distance Functions. Scale Space and Variational Methods in Computer Vision. 2009

    2009

  202. [213]

    The Schr

    Sethi, Manu and Rangarajan, Anand and Gurumoorthy, Karthik , booktitle=. The Schr. 2012 , organization=

    2012

  203. [214]

    European Conference on Computer Vision , year=

    OpenDR: An approximate differentiable renderer , author=. European Conference on Computer Vision , year=

  204. [215]

    ACM Transactions on Graphics (TOG) , volume=

    Fast evaluation of smooth distance constraints on co-dimensional geometry , author=. ACM Transactions on Graphics (TOG) , volume=. 2022 , publisher=

    2022

  205. [216]

    2006 , publisher=

    Gaussian processes for machine learning , author=. 2006 , publisher=

    2006

  206. [217]

    2022 , url =

    Yu, Zehao and Chen, Anpei and Antic, Bozidar and Peng, Songyou Peng and Bhattacharyya, Apratim and Niemeyer, Michael and Tang, Siyu and Sattler, Torsten and Geiger, Andreas , title =. 2022 , url =

    2022

  207. [218]

    arXiv preprint arXiv:2302.04264 , year =

    Tancik, Matthew and Weber, Ethan and Ng, Evonne and Li, Ruilong and Yi, Brent and Kerr, Justin and Wang, Terrance and Kristoffersen, Alexander and Austin, Jake and Salahi, Kamyar and Ahuja, Abhik and McAllister, David and Kanazawa, Angjoo , title =. arXiv preprint arXiv:2302.0...

    arXiv

  208. [219]

    Proceedings of the 28th annual conference on Computer graphics and interactive techniques , pages=

    A signal-processing framework for inverse rendering , author=. Proceedings of the 28th annual conference on Computer graphics and interactive techniques , pages=

  209. [220]

    Mildenhall, Ben and Srinivasan, Pratul P and Tancik, Matthew and Barron, Jonathan T and Ramamoorthi, Ravi and Ng, Ren , journal=

  210. [221]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Differentiable volumetric rendering: Learning implicit 3d representations without 3d supervision , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  211. [222]

    IEEE/CVF International Conference on Computer Vision , year=

    Unisurf: Unifying neural implicit surfaces and radiance fields for multi-view reconstruction , author=. IEEE/CVF International Conference on Computer Vision , year=

  212. [223]

    2005 , publisher=

    Level set methods and dynamic implicit surfaces , author=. 2005 , publisher=

    2005

  213. [224]

    2021 , publisher=

    Statistical inference , author=. 2021 , publisher=

    2021

  214. [225]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Plenoxels: Radiance fields without neural networks , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  215. [226]

    2003 , publisher=

    Statistical models , author=. 2003 , publisher=

    2003

  216. [227]

    arXiv preprint arXiv:2008.03824 , year=

    Neural reflectance fields for appearance acquisition , author=. arXiv preprint arXiv:2008.03824 , year=

    2008 arXiv

  217. [228]

    European Conference on Computer Vision , year=

    Deep reflectance volumes: Relightable reconstructions from multi-view photometric images , author=. European Conference on Computer Vision , year=

  218. [229]

    2022 , publisher=

    Partial differential equations , author=. 2022 , publisher=

    2022

  219. [230]

    ACM SIGGRAPH Conference Papers , year =

    Dai, Pinxuan and Xu, Jiamin and Xie, Wenxiang and Liu, Xinguo and Wang, Huamin and Xu, Weiwei , title =. ACM SIGGRAPH Conference Papers , year =

  220. [231]

    IEEE Transactions on Visualization and Computer Graphics , year=

    EWA splatting , author=. IEEE Transactions on Visualization and Computer Graphics , year=

  221. [232]

    2025 , booktitle=

    HotSpot: Signed Distance Function Optimization with an Asymptotically Sufficient Condition , author=. 2025 , booktitle=

    2025

  222. [233]

    ACM Trans

    3D Gaussian splatting for real-time radiance field rendering , author=. ACM Trans. Graph. , year=

  223. [234]

    ACM SIGGRAPH Conference Proceedings , year=

    Relu fields: The little non-linearity that could , author=. ACM SIGGRAPH Conference Proceedings , year=

  224. [235]

    International Conference on Learning Representations , year=

    Voxurf: Voxel-based Efficient and Accurate Neural Surface Reconstruction , author=. International Conference on Learning Representations , year=

  225. [236]

    International Cconference on Artificial Intelligence and Statistics , year=

    Deep sparse rectifier neural networks , author=. International Cconference on Artificial Intelligence and Statistics , year=

  226. [237]

    2006 , publisher=

    Multiple scattering of light by particles: radiative transfer and coherent backscattering , author=. 2006 , publisher=

    2006

  227. [238]

    Computer Graphics Forum , volume=

    Monte Carlo methods for volumetric light transport simulation , author=. Computer Graphics Forum , volume=. 2018 , organization=

    2018

  228. [239]

    1998 , publisher=

    Markov chains , author=. 1998 , publisher=

    1998

  229. [240]

    Wang, Peng and Liu, Lingjie and Liu, Yuan and Theobalt, Christian and Komura, Taku and Wang, Wenping , journal=. Neu

  230. [241]

    Barron, Jonathan T and Mildenhall, Ben and Tancik, Matthew and Hedman, Peter and Martin-Brualla, Ricardo and Srinivasan, Pratul P , booktitle=. Mip-

  231. [242]

    IEEE Transactions on Visualization and Computer Graphics , year=

    Optical models for direct volume rendering , author=. IEEE Transactions on Visualization and Computer Graphics , year=

  232. [243]

    Verbin, Dor and Hedman, Peter and Mildenhall, Ben and Zickler, Todd and Barron, Jonathan T and Srinivasan, Pratul P , booktitle=. Ref-

  233. [244]

    Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

    Multi-view supervision for single-view reconstruction via differentiable ray consistency , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , pages=

  234. [245]

    IEEE/CVF Conference on computer vision and pattern recognition , pages=

    Occupancy networks: Learning 3d reconstruction in function space , author=. IEEE/CVF Conference on computer vision and pattern recognition , pages=

  235. [246]

    International Conference on Artificial Intelligence and Statistics , year=

    The fast kernel transform , author=. International Conference on Artificial Intelligence and Statistics , year=

  236. [247]

    Alexey Dosovitskiy and German Ros and Felipe Codevilla and Antonio Lopez and Vladlen Koltun , booktitle =

  237. [248]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Shadowneus: Neural sdf reconstruction by shadow ray supervision , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  238. [249]

    IEEE/CVF International Conference on Computer Vision , year=

    Neurbf: A neural fields representation with adaptive radial basis functions , author=. IEEE/CVF International Conference on Computer Vision , year=

  239. [250]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Eclipse: Disambiguating illumination and materials using unintended shadows , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  240. [251]

    2024 , journal =

    Spainhour, Jacob and Gunderman, David and Weiss, Kenneth , title =. 2024 , journal =

    2024

  241. [252]

    Transactions of the American mathematical society , volume=

    Viscosity solutions of Hamilton-Jacobi equations , author=. Transactions of the American mathematical society , volume=

  242. [253]

    Shape, Light, and Material Decomposition from Images using Monte Carlo Rendering and Denoising , year =

    Hasselgren, Jon and Hofmann, Nikolai and Munkberg, Jacob , booktitle =. Shape, Light, and Material Decomposition from Images using Monte Carlo Rendering and Denoising , year =

  243. [254]

    Computer Physics Reports , volume=

    Principles of boundary element methods , author=. Computer Physics Reports , volume=. 1987 , publisher=

    1987

  244. [255]

    2009 , publisher=

    Directional statistics , author=. 2009 , publisher=

    2009

  245. [256]

    Wavelets, multilevel methods and elliptic PDEs , year=

    A short course on fast multipole methods , author=. Wavelets, multilevel methods and elliptic PDEs , year=

  246. [257]

    Statistical Science , volume=

    Understanding the shape of the hazard rate: A process point of view (with comments and a rejoinder by the authors) , author=. Statistical Science , volume=. 2001 , publisher=

    2001

  247. [258]

    ACM Trans

    Instant neural graphics primitives with a multiresolution hash encoding , author=. ACM Trans. Graph. , year=

  248. [259]

    Adaptive Shells for Efficient Neural Radiance Field Rendering , year =

    Wang, Zian and Shen, Tianchang and Nimier-David, Merlin and Sharp, Nicholas and Gao, Jun and Keller, Alexander and Fidler, Sanja and M\". Adaptive Shells for Efficient Neural Radiance Field Rendering , year =

  249. [260]

    ACM SIGGRAPH Asia Conference Papers , year=

    Neural Stochastic Poisson Surface Reconstruction , author=. ACM SIGGRAPH Asia Conference Papers , year=

  250. [261]

    Gaussian Processes in Practice , year=

    Gaussian process implicit surfaces , author=. Gaussian Processes in Practice , year=

  251. [262]

    Stochastic

    Sell. Stochastic. ACM Trans. Graph. , volume=. 2022 , publisher=

    2022

  252. [263]

    Advances in Neural Information Processing Systems , volume=

    Volume rendering of neural implicit surfaces , author=. Advances in Neural Information Processing Systems , volume=

  253. [264]

    NeuS codebase , publisher =

    Wang, Peng and Liu, Lingjie and Liu, Yuan and Theobalt, Christian and Komura, Taku and Wang, Wenping , year=. NeuS codebase , publisher =. GitHub repository , howpublished =

  254. [265]

    2021 , journal =

    Metzer, Gal and Hanocka, Rana and Zorin, Denis and Giryes, Raja and Panozzo, Daniele and Cohen-Or, Daniel , title =. 2021 , journal =

    2021

  255. [266]

    and Cline, Harvey E

    Lorensen, William E. and Cline, Harvey E. , title =. 1987 , booktitle =

    1987

  256. [267]

    Advances in neural information processing systems , year=

    Weight normalization: A simple reparameterization to accelerate training of deep neural networks , author=. Advances in neural information processing systems , year=

  257. [268]

    Neural RGB-D Surface Reconstruction , booktitle =

    Azinovi\'c, Dejan and Martin-Brualla, Ricardo and Goldman, Dan B and Nie. Neural RGB-D Surface Reconstruction , booktitle =

  258. [269]

    Advances in Neural Information Processing Systems , year=

    Geo-Neus: Geometry-Consistent Neural Implicit Surfaces Learning for Multi-view Reconstruction , author=. Advances in Neural Information Processing Systems , year=

  259. [270]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Urban Radiance Fields , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  260. [271]

    Zehao Yu and Songyou Peng and Michael Niemeyer and Torsten Sattler and Andreas Geiger , booktitle=. Mono

  261. [272]

    2022 , booktitle =

    Sun, Jiaming and Chen, Xi and Wang, Qianqian and Li, Zhengqi and Averbuch-Elor, Hadar and Zhou, Xiaowei and Snavely, Noah , title =. 2022 , booktitle =

    2022

  262. [273]

    2022 , booktitle=

    Wang, Jiepeng and Wang, Peng and Long, Xiaoxiao and Theobalt, Christian and Komura, Taku and Liu, Lingjie and Wang, Wenping , title =. 2022 , booktitle=

    2022

  263. [274]

    2016 , booktitle =

    Dupuy, Jonathan and Heitz, Eric and d'Eon, Eugene , title =. 2016 , booktitle =

    2016

  264. [275]

    International Journal of Computer Vision , year=

    Large-Scale Data for Multiple-View Stereopsis , author=. International Journal of Computer Vision , year=

  265. [276]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    BlendedMVS: A Large-scale Dataset for Generalized Multi-view Stereo Networks , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  266. [277]

    arXiv:2010.07492 , year =

    Kai Zhang and Gernot Riegler and Noah Snavely and Vladlen Koltun , title =. arXiv:2010.07492 , year =

    2010 arXiv

  267. [278]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Point-nerf: Point-based neural radiance fields , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  268. [279]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , year=

    Surface reconstruction from point clouds: A survey and a benchmark , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , year=

  269. [280]

    2018 , journal =

    Lu, Wenjia and Shi, Zuoqiang and Sun, Jian and Wang, Bin , title =. 2018 , journal =

    2018

  270. [281]

    2022 , journal =

    Lin, Siyou and Xiao, Dong and Shi, Zuoqiang and Wang, Bin , title =. 2022 , journal =

    2022

  271. [282]

    ACM Trans

    Globally consistent normal orientation for point clouds by regularizing the winding-number field , author=. ACM Trans. Graph. , year=

  272. [283]

    2023 , booktitle=

    NeuS2: Fast Learning of Neural Implicit Surfaces for Multi-view Reconstruction , author=. 2023 , booktitle=

    2023

  273. [284]

    IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

    Neuralangelo: High-Fidelity Neural Surface Reconstruction , author=. IEEE/CVF Conference on Computer Vision and Pattern Recognition , year=

  274. [285]

    Fast Convolutional Distance Transform , year=

    Karam, Christina and Sugimoto, Kenjiro and Hirakawa, Keigo , journal=. Fast Convolutional Distance Transform , year=

  275. [286]

    2024 , eprint=

    Accuracy Improvements for Convolutional and Differential Distance Function Approximations , author=. 2024 , eprint=

    2024

  276. [287]

    2026 , issn =

    Heat method extensions for distance function estimation in planar and space domains , journal =. 2026 , issn =. doi:10.1016/j.cad.2025.103968 , author =

    2026

  277. [288]

    2024 , eprint=

    Laplace Meets Moreau: Smooth Approximation to Infimal Convolutions Using Laplace's Method , author=. 2024 , eprint=

    2024

  278. [289]

    1999 , doi=

    Advanced Mathematical Methods for Scientists and Engineers I: Asymptotic Methods and Perturbation Theory , author=. 1999 , doi=

    1999

  279. [290]

    ACM Trans

    Kolluri, Ravikrishna , title =. ACM Trans. Algorithms , month = may, articleno =. 2008 , issue_date =. doi:10.1145/1361192.1361195 , abstract =

    2008

  280. [291]

    Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing , pages =

    Adamson, Anders and Alexa, Marc , title =. Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing , pages =. 2003 , isbn =

    2003

  281. [292]

    The Approximation Power of Moving Least-Squares , urldate =

    David Levin , journal =. The Approximation Power of Moving Least-Squares , urldate =

  282. [293]

    ACM Trans

    Amenta, Nina and Kil, Yong Joo , title =. ACM Trans. Graph. , month = aug, pages =. 2004 , issue_date =. doi:10.1145/1015706.1015713 , abstract =

    2004

  283. [294]

    Algebraic point set surfaces , year =

    Guennebaud, Ga\". Algebraic point set surfaces , year =. ACM Trans. Graph. , month = jul, pages =. doi:10.1145/1276377.1276406 , abstract =

  284. [295]

    Robust moving least-squares fitting with sharp features , year =

    Fleishman, Shachar and Cohen-Or, Daniel and Silva, Cl\'. Robust moving least-squares fitting with sharp features , year =. ACM SIGGRAPH 2005 Papers , pages =. doi:10.1145/1186822.1073227 , abstract =

    2005

  285. [296]

    Point set surfaces , year=

    Alexa, Marc and Behr, Johannes and Cohen-Or, Daniel and Fleishman, Shachar and Levin, David and Silva, Claudio T , booktitle=. Point set surfaces , year=

  286. [297]

    and Alexa, M

    Adamson, A. and Alexa, M. , booktitle=. Ray tracing point set surfaces , year=

  287. [298]

    Proceedings of the 4th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa , pages =

    Adamson, Anders and Alexa, Marc , title =. Proceedings of the 4th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa , pages =. 2006 , isbn =. doi:10.1145/1108590.1108592 , abstract =

    2006

  288. [299]

    and Shewchuk, Jonathan R

    Shen, Chen and O'Brien, James F. and Shewchuk, Jonathan R. , title =. ACM SIGGRAPH 2004 Papers , pages =. 2004 , isbn =. doi:10.1145/1186562.1015816 , abstract =

    2004

  289. [300]

    Reach For the Spheres: Tangency-aware surface reconstruction of SDFs , year =

    Sell\'. Reach For the Spheres: Tangency-aware surface reconstruction of SDFs , year =. SIGGRAPH Asia 2023 Conference Papers , articleno =. doi:10.1145/3610548.3618196 , abstract =

    2023

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.