Convex hull for intersections of random lines

MaRDI QIDQ5485343zbMATH OpenFDO

Authors Daniel Berend, Vladimir Braverman

Publication date 29 August 2006

zbMATH Keywords

convex hullrandom lines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A linear algorithm for computing convex hulls for random lines
• Convex Hulls for Random Lines
• Applications of random sampling in computational geometry. II
• Randomized quickhull
• Fast linear expected-time algorithms for computing maxima and convex hulls

Cited in

(10)

• The mean number of extreme lines in a convex hull of lines
• Weak convergence of the intersection point process of Poisson hyperplanes
• On the density of iterated line segment intersections
• A linear algorithm for computing convex hulls for random lines
• Convex Hulls for Random Lines
• On the expected number of linear complementarity cones intersected by random and semi-random rays
• scientific article; zbMATH DE number 2087472 (Why is no real title available?)
• Discrete and Computational Geometry
• On intersection probabilities of four lines inside a planar convex domain
• Capturing crossings: convex hulls of segment and plane intersections

This page was built for publication: Convex hull for intersections of random lines

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