相关论文: A note on digitized angles

We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…

This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…

This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveill\`es in…

We present a new way to merge any two point distribution approaches using distance fields. Our new process allows us to produce digital stippling that fills areas with stipple dots without visual artifacts as well as includes clear linear…

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…

If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…

Our concern is the digitalization of line segments in two dimensions as considered by Chun et al.[Discrete Comput. Geom., 2009] and Christ et al.[Discrete Comput. Geom., 2012]. The key property that differentiates the research of Chun et…

An algorithm to generate the locus of a circle using the intersection points of straight lines is proposed. The pixels on the circle are plotted independent of one another and the operations involved in finding the locus of the circle from…

We present a new method for the recognition of digital straight lines based on the slope. This method combines the Freeman's chain coding scheme and new discovered properties of the digital slope introduced in this paper. We also present…

We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.

Probably we have observed a new simple phenomena dealing with approximations to two real numbers.

This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…

We study rectangles inscribed in lines in the plane by parametrizing these rectangles in two ways, one involving slope and the other aspect ratio. This produces two paths, one that finds rectangles with specified slope and the other…

We present angle-uniform parallel coordinates, a data-independent technique that deforms the image plane of parallel coordinates so that the angles of linear relationships between two variables are linearly mapped along the horizontal axis…

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from…

We review recent advances towards the computation of string couplings. Duality symmetry, mirror symmetry, Picard-Fuchs equations, etc. are some of the tools.