On Sets of Distances of n Points
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Unit distances and diameters in Euclidean spaces
- Generalized thrackles and geometric graphs in \({\mathbb{R}}^3\) with no pair of strongly avoiding edges
- Extremal problems on triangle areas in two and three dimensions
- On distinct distances among points in general position and other related problems
- Increasing the minimum distance of a set of points
- On some metric and combinatorial geometric problems
- On large distances in planar sets
- Combinatorial reconstruction problems
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs
- Maximum planar sets that determine k distances
- The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
- A lower bound on the number of unit distances between the vertices of a convex polygon
- Lattices with few distances
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Repeated angles in the plane and related problems
- The number of different distances determined by a set of points in the Euclidean plane
- The inverse problem in electrocardiography on a spherical model
- The maximum number of second smallest distances in finite planar sets
- The largest small hexagon
- Cardinalities of k-distance sets in Minkowski spaces
- The multiplicity of the two smallest distances among points
- Popular distances in 3-space
- A postscript on distances in convex \(n\)-gons
- Some geometric applications of Dilworth's theorem
- Distinct distances in finite planar sets
- On distinct sums and distinct distances.
- Upper bounds for \(s\)-distance sets and equiangular lines
- A crossing lemma for Jordan curves
- On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
- Distinct distances between points and lines
- Incidences between points and lines on two- and three-dimensional varieties
- Covering lattice points by subspaces and counting point-hyperplane incidences
- Distinct distances and arithmetic progressions
- Working session: Additive combinatorics, entropy, and fractal geometry. Abstracts from the working session held October 8--13, 2017
- Cayley digraphs associated to arithmetic groups
- Study of upper bound problem of Heilbronn type
- Antipodality properties of finite sets in Euclidean space
- The Borsuk partition problem: the seventieth anniversary
- The maximum number of unit distances in a convex n-gon
- New lower bounds for Hopcroft's problem
- On computing the diameter of a point set in high dimensional Euclidean space.
- On the dimension of n-point sets
- Multiplicities of interpoint distances in finite planar sets
- Intervertex distances in convex polygons
- Convex polygons with few intervertex distances
- Extremal theory for convex matchings in convex geometric graphs
- Furthest neighbours in space
- Erdös distance problems in normed spaces
- The exact fitting problem in higher dimensions
- Applications of the crossing number
- Large simplices determined by finite point sets
- On the Erdős-Falconer distance problem for two sets of different size in vector spaces over finite fields
- A combinatorial problem on polynomials and rational functions
- On incidences of lines in regular complexes
- Trapezoids and deltoids in wide planar point sets
- A reduction for the distinct distances problem in \(\mathbb{R}^d\)
- Triangle areas in line arrangements
- On sets containing an affine copy of bounded decreasing sequences
- New bounds on the dimensions of planar distance sets
- Unit distance graphs and algebraic integers
- Distribution of the determinants of sums of matrices
- Degenerate drawing of outerplanar graphs with two edge lengths
- On incidence bounds with Möbius hyperbolae in positive characteristic
- Great-circle tree thrackles
- On prescribing total orders and preorders to pairwise distances of points in Euclidean space
- 2-systems of arcs on spheres with prescribed endpoints
- On distinct distances between a variety and a point set
- A refined energy bound for distinct perpendicular bisectors
- Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances
- Bisectors and pinned distances
- Distribution of distances in positive characteristic
- Distinct distances on curves via rigidity
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- One problem on geometric Ramsey numbers
- Constructions of maximum few-distance sets in Euclidean spaces
- On Falconer's distance set problem in the plane
- Characterizing optimal point sets determining one distinct triangle
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Distinct distance estimates and low degree polynomial partitioning
- Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
- Sets with few distinct distances do not have heavy lines
- Arcs intersecting at most once
- Approximation of quadrilaterals by rational quadrilaterals in the plane
- Distance Ramsey numbers
- Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
- Distance sets of well-distributed planar sets for polygonal norms
- The odd-distance plane graph
- A question from a famous paper of Erdős
- Three conjectures in extremal spectral graph theory
- The k-resultant modulus set problem on algebraic varieties over finite fields
- On the number of occurrences of the \(k\)th smallest distance between points in convex position
- Distinct distances between a collinear set and an arbitrary set of points
- Turán-type bounds for distance graphs
- The generalized \(k\)-resultant modulus set problem in finite fields
- A construction for difference sets with local properties
- Finite point configurations in the plane, rigidity and Erdős problems
- A note on distinct distance subsets
- Extremal problems for convex polygons
- Nearly equal distances and Szemerédi's regularity lemma
This page was built for publication: On Sets of Distances of n Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5836902)
