Related papers: Self-overlapping Curves Revisited
Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or self-intersections. This paper develops efficient algorithms…
We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
The mapping class group of a surface $\S$ acts on the set of closed geodesics on $\S$. This action preserves self-intersection number. In this paper, we count the orbits of curves with at most $K$ self-intersections, for each $K \geq 1$.…
We consider unbounded curves without endpoints. Isomorphism is equivalence up to translation. Self-avoiding plane-filling curves cannot be periodic, but they can satisfy the local isomorphism property: We obtain a set $\Omega $ of coverings…
A rectangle visibility representation (RVR) of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its…
A class of surfaces-graphs in a Riemannian 3-space with a prescribed projection of one field of principal directions onto a surface $\Pi$ is considered. A problem of determination of such surfaces when both principal curvatures are given…
In this work we study neighborhoods of curves in surfaces with positive self-intersection that can be embeeded as a germ of neighborhood of a curve on the projective plane.
This paper introduces a watertight technique to deal with the boundary representation of surface-surface intersection in CAD. Surfaces play an important role in today's geometric design. The mathematical model of non-uniform rational…
Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…
We show that if C is a simple closed curve bounding an embedded disk in a closed 3-manifold M, then there exists a disk D in M with boundary C such that D minimizes the area among the embedded disks with boundary C. Moreover, D is smooth,…
We prove that the torsion of any closed space curve which bounds a simply connected locally convex surface vanishes at least 4 times. This answers a question of Rosenberg related to a problem of Yau on characterizing the boundary of…
We obtain a sharp bound on the number of self-intersections of a closed planar curve with trigonometric parameterization. Moreover, we show that a generic curve of this form is normal in the sense of Whitney.
Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.
It is known that B\'{e}zier curves and surfaces may have multiple representations by different control polygons. The polygons may have different number of control points and may even be disjoint. Up to our knowledge, Pekerman et al. (2005)…
Computing a quasi-developable strip surface bounded by design curves finds wide industrial applications. Existing methods compute discrete surfaces composed of developable lines connecting sampling points on input curves which are not…
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…