A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons

DOI10.1016/0031-3203(87)90067-7zbMath0653.68026OpenAlexW1988025634MaRDI QIDQ1107994

Sukhamay Kundu

Publication date: 1987

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(87)90067-7

zbMATH Keywords

convex polygonscomputational geometryintersection2-dimensional linear programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (1)

Intersecting disks using two congruent disks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for determining the convex hull of a finite planar set
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• A Fast Algorithm for the Two-Variable Integer Programming Problem
• Computational results on an algorithm for finding all vertices of a polytope
• Feature Article—The Ellipsoid Method: A Survey
• Convex hulls of finite sets of points in two and three dimensions

This page was built for publication: A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons