Related papers: Computational Topology Counterexamples with 3D Vis…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to…
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum…
For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at…
Previously, numerical evidence was presented of a self-intersecting Bezier curve having the unknot for its control polygon. This numerical demonstration resolved open questions in scientific visualization, but did not provide a formal proof…
We describe a technique for bundled curve representations in parallel-coordinates plots and present a controlled user study evaluating their effectiveness. Replacing the traditional C^0 polygonal lines by C^1 continuous piecewise Bezier…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
We consider two mixed curve $C,C'\subset {\Bbb C}^2$ which are defined by mixed functions of two variables $\bf z=(z_1,z_2)$. We have shown in \cite{MC}, that they have canonical orientations. If $C$ and $C'$ are smooth and intersect…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…
For a smooth plane cubic $B$, we count curves $C$ of degree $d$ such that the normalizations of $C\backslash B$ are isomorphic to $\Bbb A^1$, for $d\leq7$ (for $d=7$ under some assumption). We also count plane rational quartic curves…
A surface embedded in space, in such a way that each point has a neighborhood within which the surface is a terrain, projects to an immersed surface in the plane, the boundary of which is a self-intersecting curve. Under what circumstances…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
Matrix weighted rational B\'{e}zier curves can represent complex curve shapes using small numbers of control points and clear geometric definitions of matrix weights. Explicit formulae are derived to convert matrix weighted rational…
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…
Let $(X, A)$ be a polarized nonsingular toric 3-fold with not effective $A+K_X$. Then for any ample line bundle $L$ on $X$ the image of the embedding by the complete linear system of $L$ is an intersections of quadrics.
We say that a binary linear code C has a geometric representation if there exists a two dimensional simplicial complex D such that C is a punctured code of the kernel ker D of the incidence matrix of D and dim C = dim ker D. We show that…
A method is proposed for constructing a spline curve of the Bezier type, which is continuous along with its first derivative by a piecewise polynomial function. Conditions for its existence and uniqueness are given. The constructed curve…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
Presented paper describes the method for finding the intersection of class space rational Bezier curves. The problem curve/curve intersection belongs among basic geometric problems and the aim of this article is to describe the new…