Related papers: Automating Crochet Patterns for Surfaces of Revolu…
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…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…
An extension of the Method of Regularized Stokeslets (MRS) in three dimensions is developed for triangulated surfaces with a piecewise linear force distribution. The method extends the regularized Stokeslet segment methodology used for…
Moving our hands smoothly is essential to execute ordinary tasks, such as carrying a glass of water without spilling. Past studies have revealed a natural tendency to generate smooth trajectories when moving the hand from one point to…
We use a Convolutional Recurrent Neural Network approach to learn morphological evolution driven by surface diffusion. To this aim we first produce a training set using phase field simulations. Intentionally, we insert in such a set only…
Whiskers provide a way to sense surfaces in the immediate environment without disturbing it. In this paper we present a method for using highly flexible, curved, passive whiskers mounted along a robot arm to gather sensory data as they…
Complex textured surfaces occur in nature and industry, from fingerprints to lithography-based micropatterns. Wrinkling by confinement to an incompatible substrate is an attractive way of generating reconfigurable patterned topographies,…
A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane…
Program synthesis is the process of automatically translating a specification into computer code. Traditional synthesis settings require a formal, precise specification. Motivated by computer education applications where a student learns to…
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…
This paper presents a method for mathematical modelling of surfaces conditioned on empirical data. It is based on solving a discrete biharmonic equation over a domain with given inner point and inner curve data. The inner curve data is used…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
One of the most efficient ways to produce unconditional simulations is with the spectral method using fast Fourier transform (FFT) [1]. But this approach is not applicable to arbitrary surfaces because no regular grid exists. However,…
A pants decomposition of an orientable surface S is a collection of simple cycles that partition S into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P of n points in the plane, we consider the problem of…
In this paper we construct a new class of algebraic surfaces in three-dimensional Euclidean space generated by a cyclic-harmonic curve and a congruence of circles. We study their properties and visualize them with the program Mathematica.
We adapt a well known streaming algorithm for approximating item frequencies to the matrix sketching setting. The algorithm receives the rows of a large matrix $A \in \R^{n \times m}$ one after the other in a streaming fashion. It maintains…
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
RGB cloth generation has been deeply studied in the related literature, however, 3D garment generation remains an open problem. In this paper, we build a conditional variational autoencoder for 3D garment generation and draping. We propose…