Empty squares in arbitrary orientation among points
From MaRDI portal
Publication:2700381
DOI10.1007/s00453-022-01002-1OpenAlexW2990477440MaRDI QIDQ2700381
Publication date: 21 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.12988
Erdős-Szekeres problemarbitrary orientationsquare annulus\(L_\infty\) Voronoi diagramempty squarelargest empty square problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- A new algorithm for the largest empty rectangle problem
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- On the maximum empty rectangle problem
- On the minimum-area rectangular and square annulus problem
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Computing minimum-area rectilinear convex hull and \(L\)-shape
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Searching for empty convex polygons
- Geometric applications of a matrix-searching algorithm
- Making data structures persistent
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems
- Counting \(k\)-subsets and convex \(k\)-gons in the plane
- Finding minimum area \(k\)-gons
- Counting convex \(k\)-gons in planar point sets
- Konvexe Fünfecke in ebenen Punktmengen
- Counting convex polygons in planar point sets
- A positive fraction Erdős-Szekeres theorem
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Computing a minimum-width square annulus in arbitrary orientation
- On empty convex polygons in a planar point set
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Planar sets with few empty convex polygons
- The Erdős-Szekeres Problem
- Finding Extremal Polygons
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- Computing the Largest Empty Rectangle
- Empty Simplices in Euclidean Space
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
- Largest empty rectangle among a point set
- The Erdos-Szekeres problem on points in convex position – a survey
- Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
- Planar point sets with a small number of empty convex polygons
This page was built for publication: Empty squares in arbitrary orientation among points
