**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Publication# Bisector Energy and Few Distinct Distances

Abstract

We define the bisector energy E(P) of a set P in R-2 to be the number of quadruples (a, b, c, d) is an element of P-4 such that a, b determine the same perpendicular bisector as c, d. Equivalently, E(P) is the number of isosceles trapezoids determined by P. We prove that for any epsilon > 0, if an n-point set P has no M(n) points on a line or circle, then we have E(P) = O(M(n)(2/5) n(12/5+epsilon) + M(n)n(2)). We derive the lower bound E(P) = Omega(M(n)n(2)), matching our upper bound when M(n) is large. We use our upper bound on E(P) to obtain two rather different results: (i) If P determines O(n/root log n) distinct distances, then for any 0 < alpha

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts

Loading

Related publications

Loading

Related publications

Related concepts (10)

No results

Euclidean distance

In mathematics, the Euclidean distance between two points in Euclidean space is the length of a line segment between the two points.
It can be calculated from the Cartesian coordinates of the points

Point-set registration

In computer vision, pattern recognition, and robotics, point-set registration, also known as point-cloud registration or scan matching, is the process of finding a spatial transformation (e.g., scali

Nth root

In mathematics, taking the nth root is an operation involving two numbers, the radicand and the index or degree. Taking the nth root is written as \sqrt[n]{x}, where x is th