Translating a regular grid over a point set
From MaRDI portal
Recommendations
- Approximation of a set of points by points of a grid
- Algorithms and Computation
- scientific article; zbMATH DE number 3058521
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON
- Point configurations and translations
- The m-dimensional grid point space
- scientific article; zbMATH DE number 3905323
- scientific article; zbMATH DE number 1947380
- On grids in point-line arrangements in the plane
- On Grids in Point-Line Arrangements in the Plane
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1522945 (Why is no real title available?)
- Algorithms for Reporting and Counting Geometric Intersections
- Algorithms for projecting points to give the most uniform distribution with applications to hashing
- Concatenable segment trees (extended abstract)
- Finding the upper envelope of n line segments in O(n log n) time
- Geometric Problems with Application to Hashing
- Making data structures persistent
Cited in
(5)
This page was built for publication: Translating a regular grid over a point set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873153)