Computing the convex hull of line intersections

DOI10.1016/0196-6774(86)90010-6MaRDI QIDQ3742738zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

• Computing the convex hull in a hammock
• The traveling salesmanpProblem for lines in the plane
• Synergistic solutions for merging and computing planar convex hulls
• Weak convergence of the intersection point process of Poisson hyperplanes
• ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES
• Recursive Calculation of Relative Convex Hulls
• Computing Two-Dimensional Integer Hulls
• Computable intersection points
• Computing shortest transversals
• Geometric algorithms for finding a point in the intersection of balls
• Computing curve intersection by means of simultaneous iterations
• Capturing crossings: convex hulls of segment and plane intersections

This page was built for publication: Computing the convex hull of line intersections

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