Computing the convex hull of line intersections

DOI10.1016/0196-6774(86)90010-6zbMath0605.68063OpenAlexW1973293833MaRDI QIDQ3742738

Mikhail J. Atallah

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/419

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)

Related Items

Weak convergence of the intersection point process of Poisson hyperplanes, Computing the convex hull in a hammock, Capturing crossings: convex hulls of segment and plane intersections, Computing shortest transversals, The traveling salesmanpProblem for lines in the plane