English
Related papers

Related papers: Equal Aperture Angles Curve for some Convex Sets i…

200 papers

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…

Graphics · Computer Science 2023-06-06 Ryan Capouellez , Jiacheng Dai , Aaron Hertzmann , Denis Zorin

In this paper we investigate an arithmetic analogue of the gonality of a smooth projective curve $C$ over a number field $k$: the minimal $e$ such there are infinitely many points $P \in C(\bar{k})$ with $[k(P):k] \leq e$. Developing…

Number Theory · Mathematics 2022-08-30 Geoffrey Smith , Isabel Vogt

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Computational Geometry · Computer Science 2017-06-16 Robert Graham , Adam M. Oberman

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.…

Numerical Analysis · Mathematics 2022-06-02 Sebastián Elías Graiff Zurita , Kenji Kajiwara , Kenjiro T. Miura

We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…

Numerical Analysis · Mathematics 2016-08-05 David Brander , Jens Gravesen , Toke Bjerge Nørbjerg

We develop a method for computing all the {\it generalized asymptotes} of a real plane algebraic curve $\cal C$ over $\Bbb C$ implicitly defined by an irreducible polynomial $f(x,y)\in {\Bbb R}[x,y]$. The approach is based on the notion of…

Algebraic Geometry · Mathematics 2014-05-02 Angel Blasco , Sonia Pérez-Díaz

Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…

Computational Geometry · Computer Science 2012-03-05 Liyong Shen , Chunming Yuan , Xiao-Shan Gao

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

Metric Geometry · Mathematics 2012-05-04 Don Coppersmith , Gyozo Nagy , Alex Ravsky

A criterion for the existence of a plane model of an algebraic curve such that the Galois closures of projections from two points are the same is presented. As an application, it is proved that the Hermitian curve in positive characteristic…

Algebraic Geometry · Mathematics 2022-10-06 Satoru Fukasawa , Kazuki Higashine , Takeshi Takahashi

This paper explores the relationship between closed curves on surfaces and their intersections. Like Dehn-Thurston coordinates for simple curves, we explore how to determine closed curves using the number of times they intersect other…

Geometric Topology · Mathematics 2023-08-29 Hugo Parlier , Binbin Xu

In this survey, we report on progress concerning families of projective curves with fixed number and fixed (topological or analytic) types of singularities. We are, in particular, interested in numerical, universal and asymptotically proper…

Algebraic Geometry · Mathematics 2007-05-23 Gert-Martin Greuel , Christoph Lossen , Eugenii Shustin

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…

Geometric Topology · Mathematics 2019-02-06 Yurii Burman , Michael Polyak

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

Metric Geometry · Mathematics 2020-04-03 Dirk Frettlöh , Christian Richter

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

Optimization and Control · Mathematics 2023-03-24 Hamza Fawzi , João Gouveia , Pablo A. Parrilo , James Saunderson , Rekha R. Thomas

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

Optimization and Control · Mathematics 2014-02-11 C. H. Jeffrey Pang

Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…

Optimization and Control · Mathematics 2018-11-06 Dmitriy Drusvyatskiy , Adrian S. Lewis

An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is an L-shape, and every edge is either…

Computational Geometry · Computer Science 2019-09-04 Giuseppe Liotta , Fabrizio Montecchiani

In this paper we deal with a general type of integral formulas of the visual angle, among them those of Crofton, Hurwitz and Masotti, from the point of view of Integral Geometry. The purpose is twofold: to provide an interpretation of these…

Differential Geometry · Mathematics 2019-06-26 Julià Cufí , Eduardo Gallego , Agustí Reventós

In this paper we give a characterization of all order isomorphisms on some classes of convex functions. We deal with the class $Cvx(K)$ consisting of lower-semi-continuous convex functions defined on a convex set $K$, and its subclass…

Functional Analysis · Mathematics 2015-10-14 S. Artstein-Avidan , D. I. Florentin , V. D. Milman

We study the generalization of split, k-branch split, and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the…

Optimization and Control · Mathematics 2014-06-12 Sina Modaresi , Mustafa R. Kılınç , Juan Pablo Vielma