An improved algorithm for intersecting convex polygons

DOI10.1016/S0020-0190(96)00195-0MaRDI QIDQ286975zbMATH OpenOpenAlexFDO

Authors Youssef G. Saab

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00195-0

zbMATH Keywords

algorithmscomputational geometryconvex polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A new linear algorithm for intersecting convex polygons

Cited in

(4)

• scientific article; zbMATH DE number 1318519 (Why is no real title available?)
• scientific article; zbMATH DE number 6789228 (Why is no real title available?)
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• scientific article; zbMATH DE number 1809601 (Why is no real title available?)

This page was built for publication: An improved algorithm for intersecting convex polygons

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