The grid placement problem

DOI10.1007/3-540-44634-6_17MaRDI QIDQ4778553zbMATH OpenFDO

Authors Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250180

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Translating a regular grid over a point set
• Efficient data structures for range searching on a grid
• On covering Z-grid points by rectangles
• covering grid points in a convex polygon with straight lines^∗
• A p-center grid-positioning aggregation procedure

Cited in

(9)

• Exact solution of the 2-dimensional grid arrangement problem
• Uniformly inserting points on square grid
• A Danzer set for axis parallel boxes
• Optimal gridpositioning or single facility location on the torus
• Online uniformly inserting points on grid
• The hardness of the grid problemGi Under the Routine Resolution Method
• The table placement problem: a research challenge at the EWI 2007
• Unit disk cover problem in 2D
• A heuristic approach to domino grid problem

This page was built for publication: The grid placement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778553)