scientific article; zbMATH DE number 17632

zbMATH Open0741.68096MaRDI QIDQ3974960FDOQ3974960

Authors: K. H. Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• A linear algorithm for computing convex hulls for random lines
• Delaunay triangulation and the convex hull of n points in expected linear time
• Randomized quickhull
• An efficient and numerically correct algorithm for the 2D convex hull problem
• On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

zbMATH Keywords

convex hull algorithmsexpected runtime

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (10)

• LATIN 2004: Theoretical Informatics
• Title not available (Why is that?)
• Delaunay triangulation and the convex hull of n points in expected linear time
• A linear algorithm for computing convex hulls for random lines
• Fast linear expected-time algorithms for computing maxima and convex hulls
• Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
• Convex Hulls of Random Walks
• On the oscillation of the expected number of extreme points of a random set
• A note on the expected time required to construct the outer layer
• Self-improving algorithms for convex hulls

This page was built for publication:

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