The complexity of the outer face in arrangements of random segments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Capturing crossings: Convex hulls of segment and plane intersections
Information Processing Letters
A linear algorithm for computing convex hulls for random lines
ACM Transactions on Algorithms (TALG)
Wedges in euclidean arrangements
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
| Hi-index | 0.00 |