Related papers: The largest angle bisection procedure
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…
An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. In this paper we…
A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets.…
In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this…
A point in the interior of a planar triangle determines a subdivision into six subtriangles. A triangle with angles commensurable with $\pi$ is called $\pi$-commensurable. For such a triangle a subdivision where each of the subtriangles are…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
In a graph $G=(V,E)$, a bisection $(X,Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $|X|\le |Y|\le |X|+1$. The size of $(X,Y)$ is the number of edges between $X$ and $Y$. In the Max Bisection problem we are given a graph…
Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…
Given an undirected graph with edge costs and node weights, the minimum bisection problem asks for a partition of the nodes into two parts of equal weight such that the sum of edge costs between the parts is minimized. We give a polynomial…
An equilateral triangle cannot be dissected into finitely many mutually incongruent equilateral triangles [Tutte 1948]. Therefore Tuza [Tuza 1991] asked for the largest number $s=s(n)$ such that there is a tiling of an equilateral triangle…
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
In this paper, we present an algorithm which allows us to search for all the bisections for the binomial coefficients $\{\binom{n}{k} \}_{k=0,...,n}$ and include a table with the results for all $n\le 154$. Connections with previous work on…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…
We suggest a geometric visualization of the process of constructing a triangle with prescribed bisectors that makes the existence of such a triangle geometrically evident.