MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON

DOI10.1142/S0218195995000052zbMATH Open0818.68142OpenAlexW2135436321MaRDI QIDQ4698352FDOQ4698352

Authors: Rolf Klein, Andrzej Lingas 

Publication date: 20 August 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195995000052

Recommendations

• A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON
• Approximating a minimum Manhattan network
• A shortest-path algorithm for Manhattan graphs

zbMATH Keywords

Voronoi diagramManhattan metric

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (6)

• Functional pearl: nearest shelters in Manhattan
• The geometry of Minkowski spaces -- a survey. II.
• Optimally fast incremental Manhattan plane embedding and planar tight span construction
• Optimal parallel algorithms for rectilinear link-distance problems
• Proximity in triangulations and quadrangulations
• A linear-time construction of the relative neighborhood graph within a histogram

This page was built for publication: MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON

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