Related papers: Automating Crochet Patterns for Surfaces of Revolu…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
A result is given to find points where a real valued function on the plane is not smooth. Provided this function is induced by a smooth mapping from three dimensions to the plane, from a function on surfaces in three dimensions. This has…
We solve the problem of prescribing different types of curvatures (principal, mean or Gaussian) on rotational surfaces in terms of arbitrary continuous functions depending on the distance from the surface to the axis of revolution. In this…
Robotic manipulation of deformable objects remains a challenging task. One such task is to iron a piece of cloth autonomously. Given a roughly flattened cloth, the goal is to have an ironing plan that can iteratively apply a regular iron to…
In this paper we study similarity measures for moving curves which can, for example, model changing coastlines or retreating glacier termini. Points on a moving curve have two parameters, namely the position along the curve as well as time.…
Ruled surface is widely used in engineering design such as parting surface design of injection mold and checking surface design of checking fixture, which are usually generated by offsetting 3D curves. However, in 3D curve offset, there…
We propose a novel method to generate a small set of ruled surfaces that do not collide with the input shape for linear hot-wire rough machining. Central to our technique is a new observation: the ruled surfaces constructed by vertical…
Voxel coloring is a popular method of reconstructing a three-dimensional surface model from a set of calibrated 2D images. However, the reconstruction quality is largely dependent on a thresholding procedure allowing the authors to decide,…
In this work, a 2D contour generation algorithm is proposed for irregular regions. The contour of the physical domain is approximated by mesh segments using the known coordinates of the contour. For this purpose, the algorithm uses a…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface…
We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the…
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
Randomly sampling points on surfaces is an essential operation in geometry processing. This sampling is computationally straightforward on explicit meshes, but it is much more difficult on other shape representations, such as widely-used…
This paper presents a new algorithm for generating planar circle patterns. The algorithm employs gradient descent and conjugate gradient method to compute circle radii and centers separately. Compared with existing algorithms, the proposed…
An efficient algorithm is required to extract moving objects (asteroids, satellites, and space debris) from enormous data with advances in observational instruments. We have developed an algorithm, tracee, to swiftly detect points aligned…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
The classical Whitney formula relates the number of times an oriented plane curve cuts itself to its rotation number and the index of a base point. In this paper we generalize Whitney's formula to curves on an oriented punctured surface. To…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
We develop a direct and elementary (calculus-free) exposition of the famous cubic surface of revolution x^3+y^3+z^3-3xyz=1.12 pages. We have added a second elementary proof that the surface is of revolution.
Marching surfaces is a method for isosurface extraction and approximation based on a $G^1$ multi-sided patch interpolation scheme. Given a 3D grid of scalar values, an underlying curve network is formed using second order information and…