1,626 research outputs found
Multi-triangulations as complexes of star polygons
Maximal -crossing-free graphs on a planar point set in convex
position, that is, -triangulations, have received attention in recent
literature, with motivation coming from several interpretations of them.
We introduce a new way of looking at -triangulations, namely as complexes
of star polygons. With this tool we give new, direct, proofs of the fundamental
properties of -triangulations, as well as some new results. This
interpretation also opens-up new avenues of research, that we briefly explore
in the last section.Comment: 40 pages, 24 figures; added references, update Section
The Relation Between Offset and Conchoid Constructions
The one-sided offset surface Fd of a given surface F is, roughly speaking,
obtained by shifting the tangent planes of F in direction of its oriented
normal vector. The conchoid surface Gd of a given surface G is roughly speaking
obtained by increasing the distance of G to a fixed reference point O by d.
Whereas the offset operation is well known and implemented in most CAD-software
systems, the conchoid operation is less known, although already mentioned by
the ancient Greeks, and recently studied by some authors. These two operations
are algebraic and create new objects from given input objects. There is a
surprisingly simple relation between the offset and the conchoid operation. As
derived there exists a rational bijective quadratic map which transforms a
given surface F and its offset surfaces Fd to a surface G and its conchoidal
surface Gd, and vice versa. Geometric properties of this map are studied and
illustrated at hand of some complete examples. Furthermore rational universal
parameterizations for offsets and conchoid surfaces are provided
Bisector energy and few distinct distances
We introduce the bisector energy of an -point set in ,
defined as the number of quadruples from such that and
determine the same perpendicular bisector as and . If no line or circle
contains points of , then we prove that the bisector energy is
. We also prove the
lower bound , which matches our upper bound when is
large. We use our upper bound on the bisector energy to obtain two rather
different results:
(i) If determines distinct distances, then for any
, either there exists a line or circle that contains
points of , or there exist
distinct lines that contain points of . This result
provides new information on a conjecture of Erd\H{o}s regarding the structure
of point sets with few distinct distances.
(ii) If no line or circle contains points of , then the number of
distinct perpendicular bisectors determined by is
. This appears to
be the first higher-dimensional example in a framework for studying the
expansion properties of polynomials and rational functions over ,
initiated by Elekes and R\'onyai.Comment: 18 pages, 2 figure
- …