相关论文: Points and lines configurations for perpendicular …

Consider a 2D coordinate space with a set of red and a set of blue points. We define a scenic point as a point that is equidistant to a red point and a blue point. The set of contiguous scenic points form a scenic path. The perpendicular…

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…

Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…

We provide a way of determining the infinitesimal rigidity of rod configurations realizing a rank two incidence geometry in the Euclidean plane. We model each rod with a cone over its point set and prove that the resulting geometric…

It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…

This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…

The automorphism groups of several of Thompson's countable groups of piecewise linear homeomorphisms of the line and circle are computed and it is shown that the outer automorphism groups of these groups are relatively small. These results…

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

We study directed random graphs (random graphs whose edges are directed) as they evolve in discrete time by the addition of nodes and edges. For two distinct evolution strategies, one that forces the graph to a condition of near acyclicity…

Suppose an interval is put on a horizontal line with random roughness. With probability one it is supported at two points, one from the left, and another from the right from its center. We compute probability distribution of support points…

The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…

Using the circle method, we count integer points on complete intersections in biprojective space in boxes of different side length, provided the number of variables is large enough depending on the degree of the defining equations and…

This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the topology of the configuration space. We…

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 consider the problem of finding the probability that a random triangle is obtuse, which was first raised by Lewis Caroll. Our investigation leads us to a natural correspondence between plane polygons and the Grassmann manifold of…

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…

We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI statements, we associate a polynomial ideal…

This paper studies circle patterns from the viewpoint of configurations. By using the topological degree theory, we extend the Koebe-Andreev-Thurston Theorem to include circle patterns with obtuse exterior intersection angles. As a…

Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of…