# Sum-of-squares geometry processing

@article{Marschner2021SumofsquaresGP, title={Sum-of-squares geometry processing}, author={Zoe Marschner and Paul Zhang and David R Palmer and Justin M. Solomon}, journal={ACM Transactions on Graphics (TOG)}, year={2021}, volume={40}, pages={1 - 13} }

Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra, joined with an ever-expanding variety of objectives one might want to achieve with them. With the recent increase in attention toward higher-order surfaces, we can expect a variety of challenges porting existing solutions that work on triangle meshes to work…

## Figures and Tables from this paper

## One Citation

Grid-Free Monte Carlo for PDEs with Spatially Varying Coefficients

- MathematicsArXiv
- 2022

Fig. 1. Distribution of heat (inset) radiating from infinitely many blackbodies—about 600M effective boundary vertices are visible from this viewpoint alone. (Here we visualize a 2D slice of the full…

## References

SHOWING 1-10 OF 43 REFERENCES

Monte Carlo geometry processing

- Computer ScienceACM Trans. Graph.
- 2020

This paper explores how core problems in PDE-based geometry processing can be efficiently and reliably solved via grid-free Monte Carlo methods, and develops a complete "black box" solver that encompasses integration, variance reduction, and visualization.

A bézier-based approach to unstructured moving meshes

- Computer ScienceSCG '04
- 2004

Although in this work this work has concentrated on quadratic elements, most of the operations are valid for elements of any order and they generalize well to higher dimensions.

Semidefinite Optimization and Convex Algebraic Geometry

- Mathematics
- 2012

This book provides a self-contained, accessible introduction to the mathematical advances and challenges resulting from the use of semidefinite programming in polynomial optimization. This quickly…

Geometry of 3D Environments and Sum of Squares Polynomials

- Computer Science, MathematicsRobotics: Science and Systems
- 2017

Algebraic techniques from sum of squares optimization are used that reduce all tasks related to spatial reasoning of a 3D environment to semidefinite programs of small size and present numerical experiments in realistic scenarios.

Bijective and coarse high-order tetrahedral meshes

- Computer Science
- 2021

A robust and automatic algorithm to convert linear triangle meshes with feature annotated into coarse tetrahedral meshes with curved elements is introduced, demonstrating the robustness and effectiveness of the algorithm by generating high-order meshes for a large collection of complex 3D models.

Bézier guarding

- Computer Science, MathematicsACM Trans. Graph.
- 2020

A mesh generation algorithm for the curvilinear triangulation of planar domains with piecewise polynomial boundary based on a novel explicit construction of guaranteed injective Bézier triangles with certain edge curves and edge parametrizations prescribed.

Monte Carlo Geometry Processing:A Grid-Free Approach to PDE-Based Methods on Volumetric Domains

- Computer Science
- 2020

This paper presents a Monte Carlo solver for FEM-based geometric algorithms that uses about 1GB of memory and takes less than a minute to provide a preview that can be progressively refined.

Poly-Spline Finite-Element Method

- Computer ScienceACM Trans. Graph.
- 2019

An integrated meshing and finite-element method pipeline enabling solution of partial differential equations in the volume enclosed by a boundary representation and validate the approach solving Poisson’s equation on a large collection of models, only requiring the user to provide boundary conditions on their surface.

Efficient point-projection to freeform curves and surfaces

- Mathematics, Computer ScienceComput. Aided Geom. Des.
- 2012

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

- MathematicsSIAM J. Optim.
- 1995

It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.