Capturing crossings: convex hulls of segment and plane intersections

DOI10.1016/J.IPL.2008.03.024zbMATH Open1186.68486OpenAlexW2167591570WikidataQ56970299 ScholiaQ56970299MaRDI QIDQ963438FDOQ963438

Authors: Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink 

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.024

Recommendations

• A linear algorithm for computing convex hulls for random lines
• Convex hull for intersections of random lines
• Convex Hulls for Random Lines
• scientific article; zbMATH DE number 2123362
• Constructing Arrangements of Lines and Hyperplanes with Applications

zbMATH Keywords

analysis of algorithmscomputational geometry

Mathematics Subject Classification ID

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

Cites Work

• Algorithms for Reporting and Counting Geometric Intersections
• Title not available (Why is that?)
• Finding the upper envelope of n line segments in O(n log n) time
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the convex hull of line intersections
• A simple algorithm for determining the envelope of a set of lines
• On Envelopes of Arrangements of Lines
• Convex Hulls for Random Lines
• Discrete and Computational Geometry
• On lazy randomized incremental construction

Cited In (2)

• Title not available (Why is that?)
• Convex Hulls for Random Lines

This page was built for publication: Capturing crossings: convex hulls of segment and plane intersections

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