Related papers: The Relation Between Offset and Conchoid Construct…
In this paper we study the local behavior of an algebraic curve under a geometric construction which is a variation of the usual offsetting construction, namely the {\it generalized} offsetting process (\cite {SS99}). More precisely, here…
We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient,…
We give an accessible introduction and elaboration on the methods used in obtaining a geodesic, which is the curve of shortest length connecting two points lying on the surface of a function. This is found through computing what's known as…
Computing offsets of curves on parametric surfaces is a fundamental yet challenging operation in computer aided design and manufacturing. Traditional analytical approaches suffer from time-consuming geodesic distance queries and complex…
We introduce a novel offset meshing approach that can robustly handle a 3D surface mesh with an arbitrary geometry and topology configurations, while nicely capturing the sharp features on the original input for both inward and outward…
The ruled surfaces, i.e., surfaces generated by one parametric set of lines, are widely used in the~field of applied geometry. An~isophote on a surface is a curve consisting of surface points whose normals form a constant angle with some…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a…
Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
We study conchoids to algebraic curve from the perspective of algebraic geometry, analyzing their main algebraic properties. We introduce the formal definition of conchoid of an algebraic curve by means of incidence diagrams. We prove that,…
We make a systematic study of the focal surface of a congruence of lines in the projective space. Using differential techniques together with techniques from intersection theory, we reobtain in particular all the invariants of the focal…
This paper deals with a kind of design of a ruled surface. It combines concepts from the fields of computer aided geometric design and kinematics. A dual unit spherical B\'ezier-like curve on the dual unit sphere (DUS) is obtained with…
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…
The aerodynamic performance of an isolated coaxial rotor in forward flight is analyzed by a high-fidelity computational fluid dynamics (CFD) approach. The analysis focuses on the high-speed forward flight with an advance ratio of 0.5 or…
We present a novel surface convolution operator acting on vector fields that is based on a simple observation: instead of combining neighboring features with respect to a single coordinate parameterization defined at a given point, we have…
Computing occluding contours is a key building block of non-photorealistic rendering, but producing contours with consistent visibility has been notoriously challenging. This paper describes the first general-purpose smooth surface…
Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…
The usual approach to developing and analyzing first-order methods for smooth convex optimization assumes that the gradient of the objective function is uniformly smooth with some Lipschitz constant $L$. However, in many settings the…
Reconstructing open surfaces from multi-view images is vital in digitalizing complex objects in daily life. A widely used strategy is to learn unsigned distance functions (UDFs) by checking if their appearance conforms to the image…