First and second nearest distances in Archimedean tilings

MaRDI QIDQ5859923zbMATH OpenFDO

Authors Masashi Miyagawa

Publication date 18 November 2021

zbMATH Keywords

average distanceEuclidean distancelocationmaximum distancePareto optimal

Mathematics Subject Classification ID

Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Discrete location and assignment (90B80) Multi-objective and goal programming (90C29)

Recommendations

• Distance sequences and percolation thresholds in archimedean tilings
• A note on the number of vertices of the Archimedean tiling
• A note on discrete lattice-periodic sets with an application to Archimedean tilings
• Minimal covers of the Archimedean tilings. II.
• Analysis of facility location using ordered rectilinear distance in regular point patterns

Cites work

• Centroidal Voronoi Tessellations: Applications and Algorithms
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• Statistics for spatial data

Cited in

(3)

• A note on the number of vertices of the Archimedean tiling
• Distances on Lozenge Tilings
• Distance sequences and percolation thresholds in archimedean tilings

This page was built for publication: First and second nearest distances in Archimedean tilings

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