Discrete and Computational Geometry
DOI10.1007/B11261zbMATH Open1179.52009OpenAlexW62175113MaRDI QIDQ5897099FDOQ5897099
Mordecai J. Golin, William Steiger, Stefan Langerman
Publication date: 5 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11261
Recommendations
- Convex Hulls for Random Lines
- Convex hull for intersections of random lines
- A linear algorithm for computing convex hulls for random lines
- On random convex hulls
- On the convex hull of random points in a polytope
- On the shape of the convex hull of random points
- The convex hull of random points on the boundary of a simple polytope
- Inequalities for convex hulls of random points
- Convex hulls of perturbed random point sets
- On the boundary structure of the convex hull of random points
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Cited In (6)
- On the expected number of linear complementarity cones intersected by random and semi-random rays
- Capturing crossings: convex hulls of segment and plane intersections
- Equiaffine inner parallel curves of a plane convex body and the convex hulls of randomly chosen points
- Weak convergence of the intersection point process of Poisson hyperplanes
- RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
- \(k\)-sets and random hulls
This page was built for publication: Discrete and Computational Geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897099)
