For a finite set U of directions in the Euclidean plane, a convex non-degenerate polygon P is called a U-polygon if every line parallel to a direction of U that meets a vertex of P also meets another vertex of P. We characterize the numbers of edges of U-polygons of class c≥4 with all their vertices in certain subsets of the plane and derive explicit results in the case of cyclotomic model sets
AbstractWhen parallel X-rays are considered in any finite set U of directions, switching components ...
A set P of points in ℝ2 is n-universal, if every planar graph on n vertices admits a plane straight-...
A set P of points inR2 is n-universal if every planar graph on n vertices admits a plane straight-li...
AbstractFor a finite set U of directions in the Euclidean plane, a convex non-degenerate polygon P i...
AbstractFor a finite set U of directions in the Euclidean plane, a convex non-degenerate polygon P i...
AbstractLet U be a finite set of directions in the Euclidean plane. A convex polygon P is a U-polygo...
AbstractLet U be a finite set of directions in the Euclidean plane. A convex polygon P is a U-polygo...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
AbstractIn this paper we study the problem of partitioning point sets in the plane so that each equi...
AbstractLet P be a finite point set in general position in the plane. We consider empty convex subse...
Let X be a finite set of points in the plane. We say that X is in general position if no three point...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A i...
A set P of points in R2 is n-universal if every planar graph on n vertices admits a plane straight-l...
AbstractA geometric graph ( = gg) is a pair G = 〈V, E〉, where V is a finite set of points ( = vertic...
AbstractWhen parallel X-rays are considered in any finite set U of directions, switching components ...
A set P of points in ℝ2 is n-universal, if every planar graph on n vertices admits a plane straight-...
A set P of points inR2 is n-universal if every planar graph on n vertices admits a plane straight-li...
AbstractFor a finite set U of directions in the Euclidean plane, a convex non-degenerate polygon P i...
AbstractFor a finite set U of directions in the Euclidean plane, a convex non-degenerate polygon P i...
AbstractLet U be a finite set of directions in the Euclidean plane. A convex polygon P is a U-polygo...
AbstractLet U be a finite set of directions in the Euclidean plane. A convex polygon P is a U-polygo...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
AbstractIn this paper we study the problem of partitioning point sets in the plane so that each equi...
AbstractLet P be a finite point set in general position in the plane. We consider empty convex subse...
Let X be a finite set of points in the plane. We say that X is in general position if no three point...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A i...
A set P of points in R2 is n-universal if every planar graph on n vertices admits a plane straight-l...
AbstractA geometric graph ( = gg) is a pair G = 〈V, E〉, where V is a finite set of points ( = vertic...
AbstractWhen parallel X-rays are considered in any finite set U of directions, switching components ...
A set P of points in ℝ2 is n-universal, if every planar graph on n vertices admits a plane straight-...
A set P of points inR2 is n-universal if every planar graph on n vertices admits a plane straight-li...