LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON

DOI10.1142/S0218195995000234zbMath0838.68109MaRDI QIDQ4858651

Joseph S. B. Mitchell, Esther M. Arkin, Subhash Suri

Publication date: 18 December 1995

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

zbMATH Keywords

link distance queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items

Diffuse reflection diameter in simple polygons, Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons, Settling the bound on the rectilinear link radius of a simple rectilinear polygon, An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains, ON GEOMETRIC PATH QUERY PROBLEMS, An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT, Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons