Related papers: Exact Analytical Parallel Vectors
The arrow graph of a function consists of two parallel axes, with arrows from input values to output values. The lines through these arrows envelop a curve which we named the focal curve. This paper studies these focal curves in detail. We…
Conceptual spaces are geometric representations of conceptual knowledge, in which entities correspond to points, natural properties correspond to convex regions, and the dimensions of the space correspond to salient features. While…
We construct new substantive examples of non-autonomous vector fields on 3-dimensional sphere having a simple dynamics but non-trivial topology. The construction is based on two ideas: the theory of diffeomorpisms with wild separatrix…
All-pairs similarity problem asks to find all vector pairs in a set of vectors the similarities of which surpass a given similarity threshold, and it is a computational kernel in data mining and information retrieval for several tasks. We…
Let M be a simply connected Riemannian symmetric space, with at most one flat direction. We show that every Riemannian (or unitary) vector bundle with parallel curvature over M is an associated vector bundle of a canonical principal bundle,…
We give a proof of the existence of radial (smooth) parallel sections of vector bundles endowed with a linear connection.
In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic properties of proper differential rational parametrizations for unirational differential…
We investigate vertices for plane curves with singular points. As plane curves with singular points, we consider Legendre curves (respectively, Legendre immersions) in the unit tangent bundle over the Euclidean plane and frontals…
Welschinger invariants enumerate real nodal rational curves in the plane or in another real rational surface. We analyze the existence of similar enumerative invariants that count real rational plane curves having prescribed non-nodal…
In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…
We study surfaces with parallel normalized mean curvature vector field in Euclidean or Minkowski 4-space. On any such surface we introduce special isothermal parameters (canonical parameters) and describe these surfaces in terms of three…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
A tetrahedral curve is a (usually nonreduced) curve in P^3 defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using…
A \emph{generic rectangular layout} (for short, \emph{layout}) is a subdivision of an axis-aligned rectangle into axis-aligned rectangles, no four of which have a point in common. Such layouts are used in data visualization and in…
We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if…
For applications in computing, Bezier curves are pervasive and are defined by a piecewise linear curve L which is embedded in R^3 and yields a smooth polynomial curve C embedded in R^3. It is of interest to understand when L and C have the…
In this paper we provide a computational approach to the shape of curves which are rational in polar coordinates, i.e. which are defined by means of a parametrization (r(t),\theta(t)) where both r(t),\theta(t) are rational functions. Our…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…