scientific article; zbMATH DE number 140466

zbMATH Open0767.68101MaRDI QIDQ4028883FDOQ4028883

Authors: Rongyao Zhao 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polygonslinear time algorithmsreachability regionsconvex pockets

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Linear-time algorithms for testing the realisability of line drawings of curved objects
• Combinatorial Geometry and Graph Theory
• Title not available (Why is that?)
• A linear-time construction of Reuleaux polygons

This page was built for publication:

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