Capturing crossings: convex hulls of segment and plane intersections
From MaRDI portal
Publication:963438
DOI10.1016/j.ipl.2008.03.024zbMath1186.68486WikidataQ56970299 ScholiaQ56970299MaRDI QIDQ963438
Jack Scott Snoeyink, Esther M. Arkin, Joseph S. B. Mitchell
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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- A simple algorithm for determining the envelope of a set of lines
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Algorithms for Reporting and Counting Geometric Intersections
- Computing the convex hull of line intersections
- Convex Hulls for Random Lines
- On Envelopes of Arrangements of Lines
- Discrete and Computational Geometry
- On lazy randomized incremental construction