Linear time algorithms for computing reachability regions from polygonal figures

DOI10.1007/3-540-51542-9_14MaRDI QIDQ4028883zbMATH OpenFDO

Authors Rongyao Zhao

Publication date 28 March 1993

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

Full work available at URL https://doi.org/10.1007/3-540-51542-9_14

zbMATH Keywords

convex pocketslinear time algorithmspolygonsreachability regions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 4074328
• A linear time algorithm for the computation of some distance functions between convex polygons
• Shortest paths in the plane with polygonal obstacles
• scientific article; zbMATH DE number 597698
• Computing the extreme distances between two convex polygons

Cited in

(5)

• Linear-time algorithms for testing the realisability of line drawings of curved objects
• A linear-time construction of Reuleaux polygons
• scientific article; zbMATH DE number 4074328 (Why is no real title available?)
• scientific article; zbMATH DE number 597698 (Why is no real title available?)
• Combinatorial Geometry and Graph Theory

This page was built for publication: Linear time algorithms for computing reachability regions from polygonal figures

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