Related papers: The Relation Between Offset and Conchoid Construct…
The unit vectors transformation between the Cartesian and the novel Similar Oblate Spheroidal coordinates, and vice versa, is derived. It can help to transform vector fields between these two types of orthogonal coordinates which can…
The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can…
We prove the connectedness and calculate the diameter of the oriented graph of graftings associated to exotic complex projective structures on a compact surface S with a given holonomy representation of Fuchsian type. The oriented graph of…
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the…
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…
Recently, 3D Gaussian Splatting (3DGS) has demonstrated impressive novel view synthesis results, while allowing the rendering of high-resolution images in real-time. However, leveraging 3D Gaussians for surface reconstruction poses…
Interpolating scattered CFD datasets onto a uniform Cartesian grid can distort the true geometry, producing a convex-hull type envelope and activating nonphysical regions. This work presents a reconstruction framework that recovers…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
We study the rationality of the components of the conchoid to an irreducible algebraic affine plane curve, excluding the trivial cases of the isotropic lines, of the lines through the focus and the circle centered at the focus and radius…
A rigorous and powerful theoretical framework is proposed to obtain systems of orthogonal functions (or shape modes) to represent optical surfaces. The method is general so it can be applied to different initial shapes and different…
Unsigned distance fields (UDFs) offer broader modeling capabilities than signed distance fields (SDFs), enabling the representation of shapes with open boundaries, non-manifold structures or mixed curve and surface parts. However,…
Soft interfaces can mediate interactions between particles bound to them. The force transmitted through the surface geometry on a particle may be expressed as a closed line integral of the surface stress tensor around that particle. This…
Transposed convolution is crucial for generating high-resolution outputs, yet has received little attention compared to convolution layers. In this work we revisit transposed convolution and introduce a novel layer that allows us to place…
In this paper, we study Bertrand surface offsets by considering the dual geodesic trihedron(dual Darboux frame) of the ruled surfaces. We obtain the relationships between the invariants of Bertrand trajectory ruled surfaces. Furthermore, we…
Confocal quadrics capture (encode) and geometrize spectral properties of symmetric operators. Certain metric-projective properties of confocal quadrics (most of them established in the first half of the XIX$^{\mathrm{th}}$ century) {\it…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph $G=(V, E)$ is a $2$-partition $V_1 \dot{\cup} V_2=V$ such that both $V_1$ and $V_2$ are convex, \ie shortest paths…
{\it Surface-directed spinodal decomposition} (SDSD) is the kinetic interplay of phase separation and wetting at a surface. This process is of great scientific and technological importance. In this paper, we report results from a numerical…
Affine rotation surfaces are a generalization of the well-known surfaces of revolution. Affine rotation surfaces arise naturally within the framework of affine differential geometry, a field started by Blaschke in the first decades of the…