Related papers: Robust Numerical Integration on Curved Polyhedra B…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
We present an algorithm to simulate the many-body depletion interaction between anisotropic colloids in an implicit way, integrating out the degrees of freedom of the depletants, which we treat as an ideal gas. Because the depletant…
Let $\mathcal{T}$ be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles,…
In the design and analysis of composite materials based on periodic arrangements of sub-units it is of paramount importance to control the emergent material symmetry in relation to the elastic response. The target material symmetry plays…
Recently, we introduced a new class of shapes, called soft cells which fill space as soft tilings without gaps and overlaps while minimizing the number of sharp corners. We introduced the edge bending algorithm that deforms a polyhedral…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
Curvature and mechanics are intimately connected for thin materials, and this coupling between geometry and physical properties is readily seen in folded structures from intestinal villi and pollen grains, to wrinkled membranes and…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
In computer graphics, smooth data reconstruction on 2D or 3D manifolds usually refers to subdivision problems. Such a method is only valid based on dense sample points. The manifold usually needs to be triangulated into meshes (or patches)…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We introduce a simple procedure to integrate differential forms with arbitrary holomorphic poles on Riemann surfaces. It gives rise to an intrinsic regularization of such singular integrals in terms of the underlying conformal geometry.…
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,…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
During the last ten years, increasing efforts were made to improve and simplify the process from Computer Aided Design (CAD) modeling to a numerical simulation. It has been shown that the transition from one model to another, i.e. the…
Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…
The present paper suggests a new approach for geometric representation of 3D spatial models and provides a new compression algorithm for 3D meshes, which is based on mathematical theory of convex geometry. In our approach we represent a 3D…
A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…
We propose a multiscale method for mixed-dimensional elliptic problems with highly heterogeneous coefficients arising, for example, in the modeling of fractured porous media. The method is based on the Localized Orthogonal Decomposition…
Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…