Expected Case for Projecting Points
TL;DR: The concentration Conc(P,L) is the number of points that its most populated cell gets in a graduated line L, which is, a line decomposed into line segments (cells) of length one.
read more
Abstract: Let P be a set of n points in the plane. For a line L ⊂ R, we can project the points P orthogonally onto L, which we denote by πL(P ). Imagine that the line L is a graduated line, that is, a line decomposed into line segments (cells) of length one. For a cell c ⊂ L, let Pop(P, c) be the population of the cell c after the projection, that is Pop(P, c) = |{p ∈ P |πL(p) ∈ c}|. For a graduated line L, we say that its concentration Conc(P,L) is the number of points that its most populated cell gets; that is,
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Computational Geometry: Algorithms and Applications
Mark de Berg,Otfried Cheong,Marc van Kreveld,Mark H. Overmars +3 more
- 01 Jan 1997
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
5.8K
The Kakeya Problem
TL;DR: In this paper, the Kakeya Problem is considered and the authors present a solution to the problem, which they call KAKAYA. The American Mathematical Monthly: Vol. 70, No. 7, pp. 697-706.
59
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
Ludek Kucera,Kurt Mehlhorn,B. Preis,E. Schwarzenecker +3 more
- 25 Feb 1993
TL;DR: In this article, the authors investigated the problem of determining the supremum of all reals in the plane for which there are n pairwise disjoint, axis-parallel squares of side length σ, where for each i, 1 ≤ i ≤ n, p i is a corner of Q i.
Optimal Point Set Projections onto Regular Grids
José Miguel Díaz-Báñez,Ferran Hurtado,Mario A. Lopez,J. Antoni Sellarès +3 more
- 15 Dec 2003
TL;DR: This paper derives algorithms that solve the simplest problem of obtaining an optimal orthogonal image of a two-dimensional or three-dimensional point set and presents algorithms that provide approximate solutions to the problems with better complexity.
3