Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Link opens in a new tab
Search content at Ben-Gurion University Research Portal
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs
A linear algorithm for computing convex hulls for random lines
Daniel Berend
, Vladimir Braverman
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A linear algorithm for computing convex hulls for random lines'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Convex Hull
100%
Linear Algorithm
100%
Random Lines
100%
Intersection Point
33%
Linear-time Algorithm
33%
Universal Algorithm
33%
Mathematics
Convex Hull
100%
Linear Time
33%
Wide Range
33%
Intersection Point
33%