相关论文: Simple Methods For Drawing Rational Surfaces as Fo…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.
A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…
We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…
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…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
For any positive integer $r$, we construct a smooth complex projective rational surface which has at least $r$ real forms not isomorphic over $\mathbb{R}$.
Using the normalized B-bases of vector spaces of trigonometric and hyperbolic polynomials of finite order, we specify control point configurations for the exact description of higher dimensional (rational) curves and (hybrid) multivariate…
We discuss the problem of existence of rational curves on a certain del Pezzo surface from a computational point of view and suggest a computer algorithm implementing search. In particular, our computations reveal that the surface contains…
We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being…
We searched up to height $10^7$ for rational points on diagonal quartic surfaces. The computations fill several gaps in earlier lists computed by Pinch, Swinnerton-Dyer, and Bright.
It is classically known that a real cubic surface in the real projective 3-space cannot have more than one solitary point (locally given by x^2+y^2+z^2=0) whereas it can have up to four nodes (x^2+y^2-z^2=0). We show that on any surface of…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm…
We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained by drawings whose vertex and crossing resolution is at least…
We present a bottom-up differentiable relaxation of the process of drawing points, lines and curves into a pixel raster. Our approach arises from the observation that rasterising a pixel in an image given parameters of a primitive can be…
We introduce an algorithm to remesh triangle meshes representing developable surfaces to planar quad dominant meshes. The output of our algorithm consists of planar quadrilateral (PQ) strips that are aligned to principal curvature…
We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…