Related papers: On a numerical algorithm for computing topological…

We present SurfCut, an algorithm for extracting a smooth, simple surface with an unknown 3D curve boundary from a noisy 3D image and a seed point. Our method is built on the novel observation that certain ridge curves of a function defined…

Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat.…

In the present paper, an integrated paradigm for topology optimization on complex surfaces with arbitrary genus is proposed. The approach is constructed based on the two-dimensional (2D) Moving Morphable Component (MMC) framework, where a…

This paper proposes a machine learning (ML) method to predict stable molecular geometries from their chemical composition. The method is useful for generating molecular conformations which may serve as initial geometries for saving time…

In this paper, we formulate a simple algorithm that detects contours around a region of interest in an image. After an initial smoothing, the method is based on viewing an image as a topographic surface and finding convex and/or concave…

We analyze a variational time discretization of geodesic calculus on finite- and certain classes of infinite-dimensional Riemannian manifolds. We investigate the fundamental properties of discrete geodesics, the associated discrete…

We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…

Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…

We propose a graph-based sweep algorithm for solving the steady state, mono-energetic discrete ordinates on meshes of high-order curved mesh elements. Our spatial discretization consists of arbitrarily high-order discontinuous Galerkin…

We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling. This poroelasticity problem suffers from rapidly oscillating material parameters, which calls for a thorough…

We study spatial discretizations of dynamical systems: is it possible to recover some dynamical features of a system from numerical simulations? Here, we tackle this issue for the simplest algorithm possible: we compute long segments of…

Adaptive structures are characterized by their ability to adjust their geometrical and other properties to changing loads or requirements during service. This contribution deals with a method for the design of quasi-static motions of…

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…

Triangulated meshes have become ubiquitous discrete-surface representations. In this paper we address the problem of how to maintain the manifold properties of a surface while it undergoes strong deformations that may cause topological…

We propose a discretization of classical confocal coordinates. It is based on a novel characterization thereof as factorizable orthogonal coordinate systems. Our geometric discretization leads to factorizable discrete nets with a novel…

We use a simple, collision-based, discrete, random abrasion model to compute the profiles for the stoss faces in a bedrock abrasion process. The model is the discrete equivalent of the generalized version of a classical, collision based…

Applying Morse theory, we give a standard form for a class of surfaces which includes all the properly embedded incompressible surfaces in 3-dimensional handlebodies. We also give a necessary and sufficient condition to determine the…