An improved algorithm for intersecting convex polygons

DOI10.1016/S0020-0190(96)00195-0zbMATH Open1336.68267OpenAlexW2094091137MaRDI QIDQ286975FDOQ286975

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

• Title not available (Why is that?)
• A new linear algorithm for intersecting convex polygons

Cited In (4)

• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)