Translating a regular grid over a point set

DOI10.1016/S0925-7721(02)00128-1zbMath1021.65008OpenAlexW2127927089WikidataQ57009436 ScholiaQ57009436MaRDI QIDQ1873153

Pat Morin, Jason Morrison, Anil Maheshwari, Prosenjit Bose, Marc J. van Kreveld

Publication date: 19 May 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00128-1

zbMATH Keywords

intervalsbinary treefacility locationdynamic data structurelazy updatemaintenance of functions

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Covering many or few points with unit disks ⋮ On simplifying dot maps.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Making data structures persistent
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• Algorithms for Reporting and Counting Geometric Intersections
• Geometric Problems with Application to Hashing
• Concatenable segment trees

This page was built for publication: Translating a regular grid over a point set