相关论文: The Logarithmic Curvature Graphs of Generalised Co…

Curves are essential concepts that enable compounded aesthetic curves, e.g., to assemble complex silhouettes, match a specific curvature profile in industrial design, and construct smooth, comfortable, and safe trajectories in vehicle-robot…

Guo and Luo introduced generalized circle patterns on surfaces and proved their rigidity. In this paper, we prove the existence of Guo-Luo's generalized circle patterns with prescribed generalized intersection angles on surfaces with cusps,…

The log-aesthetic curves include the logarithmic (equiangular) spiral, clothoid, and involute curves. Although most of them are expressed only by an integral form of the tangent vector, it is possible to interactively generate and deform…

The Cornu spirals on plane are the curves whose curvatures are linear. Generalized planar cornu spirals and Euler spirals in E^3, the curves whose curvatures are linear are defined in [1,5]. In this study, these curves are presented as the…

The research on developing planar curves to produce visually pleasing products (ranges from electric appliances to car body design) and indentifying/modifying planar curves for special purposes namely for railway design, highway design and…

A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…

Generalized cycles can be thought of as the extension of form-cycle duality between holomorphic forms and cycles, to meromorphic forms and generalized cycles. They appeared as an ubiquitous tool in the study of spectral curves and…

This article studies families of curves with monotonic curvature function (MC-curves) and their applications in geometric modelling and aesthetic design. Aesthetic analysis and assessment of the structure and plastic qualities of…

In this paper, we consider a class of plane curves called log-aesthetic curves and their generalization which are used in computer aided geometric design. We consider these curves in the framework of the similarity geometry and characterize…

How do we characterize the shape of a surface? It is now well understood that the shape of a surface is determined by measuring how curved it is at each point. From these measurements, one can identify the directions of largest and smallest…

The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs.…

In this paper, we study generalized constant ratio (GCR) hypersurfaces in Euclidean spaces. We mainly focus on the hypersurfaces in $\mathbb E^4$. First, we deal with $\delta(2)$-ideal GCR hypersurfaces. Then, we study on hypersurfaces with…

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…

This is an elementary introduction to a method for studying harmonic maps into symmetric spaces, and in particular for studying constant mean curvature (CMC) surfaces, that was developed by J. Dorfmeister, F. Pedit and H. Wu. There already…

We consider large-scale, implicit-search-based solutions to Shortest Path Problems on Graphs of Convex Sets (GCS). We propose GCS*, a forward heuristic search algorithm that generalizes A* search to the GCS setting, where a…

Kernel Regularized Least Squares (KRLS) is a popular method for flexibly estimating models that may have complex relationships between variables. However, its usefulness to many researchers is limited for two reasons. First, existing…

Graph Contrastive Learning (GCL) has emerged as a popular unsupervised graph representation learning method. However, it has been shown that GCL is vulnerable to adversarial attacks on both the graph structure and node attributes. Although…

We present an algorithm to fair a given planar curve by a log-aesthetic curve (LAC). We show how a general LAC segment can be uniquely characterized by seven parameters and present a method of parametric approximation based on this fact.…

Interest has been rising lately towards methods representing data in non-Euclidean spaces, e.g. hyperbolic or spherical, that provide specific inductive biases useful for certain real-world data properties, e.g. scale-free, hierarchical or…

We compute the geodesic curvature of logarithmic spirals on surfaces of constant Gaussian curvature. In addition, we show that the asymptotic behavior of the geodesic curvature is independent of the curvature of the ambient surface. We also…