Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line we can construct a new line through the point which forms an angle with the new line which is a multiple of π/n (folding); and given two lines we can construct the point where they cross (intersection). Starting with the line y = 0 and the points (0,0) and (1,0) we determine which points in the plane can be constructed using only these two operations for n = 3,4,5,6,8,10,12,24 and also consider the problem of the minimum number of steps it takes to construct such a point
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points ...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
We consider the following problem: Let L be an arrangement of n lines in R3 in general position colo...
A point or line E is paper-folding constructible from S if E = En for some PF construction from S. ...
AbstractConsider all arrangements of lines in the plane with r distinct slopes. What is the smallest...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points ...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
We consider the following problem: Let L be an arrangement of n lines in R3 in general position colo...
A point or line E is paper-folding constructible from S if E = En for some PF construction from S. ...
AbstractConsider all arrangements of lines in the plane with r distinct slopes. What is the smallest...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
If two Jordan curves in the plane have precisely one point in common, and there they do not properly...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
Given an arrangement of n not all coincident, not all parallel lines in the (projective or) Euclidea...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
We examine the number of triangulations that any set of n points in the plane must have, and prove t...
AbstractWe show that for every ϵ>0 there exists an angle α=α(ϵ) between 0 and π, depending only on ϵ...
We present a solution to the problem of computing a point in the plane minimizing the distance to n ...
If two closed Jordan curves in the plane have precisely one point in common, then it is called a tou...
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points ...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
We consider the following problem: Let L be an arrangement of n lines in R3 in general position colo...