Related papers: Cramer-Castillon on a Triangle's Incircle and Exci…
We classify the singular loci of real surfaces in three-space that contain two circles through each point. We characterize how a circle in such a surface meets this loci as it moves in its pencil and as such provide insight into the…
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not…
A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e.,…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
Given a simple undirected graph $G=(V,E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each part of the partition such that the chromatic number of the…
We study perimeters of connecting cycles for concentric circles. More precisely, we are interested in characterization of those connecting cycles which are critical points of perimeter considered as a function on the product of given…
A review about some recent studies on the determination of the CP-violating complex parameters in supersymmetry at an e^+ e^- linear collider is presented. CP-even observables, like masses, cross sections and branching ratios, can have a…
We study some properties of a triad of circles associated with a triangle. Each circle is inside the triangle, tangent to two sides of the triangle, and externally tangent to the circle on the third side as diameter. In particular, we find…
We systematically study the connection between P, C and strong CP in the context of both non-supersymmetric and supersymmetric left-right theories. We find that the solution to the strong CP problem requires both supersymmetry and parity…
This work studies circle-geometry methods through their application to a main theorem about circles tangent twice to a conic. The authors investigate the Sharygin point -- a point lying in the pencil of two non-intersecting circles -- and…
A problem involving a square in the curvilinear triangle made by two touching congruent circles and their common tangent is generalized.
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We introduce the cd-tree data structure and give a new…
The symmetric circulant TSP is a special case of the traveling salesman problem in which edge costs are symmetric and obey circulant symmetry. Despite the substantial symmetry of the input, remarkably little is known about the symmetric…
In this paper, we study several topics on pedal polygons. First, we prove the existence for pedal centers of triangles in a new way. From its proof, we find that the sum of area of outer and inner polygons is invariant under rotation.…
We resolve the periodic square peg problem using a simple Lagrangian Floer homology argument. Inscribed squares are interpreted as intersections between two non-displaceable Lagrangian sub-manifolds of a symplectic 4-torus.
We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…
Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer…