Constructing the convex hull of a partially sorted set of points
type: Item
instance of: scholarly article
title: Constructing the convex hull of a partially sorted set of points
zbMATH Open document ID: 0797.68159
DOI: 10.1016/0925-7721(93)90023-Y
author: Michael T. Goodrich
published in: Computational Geometry
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 220607
zbMATH Keywords: computational geometry
zbMATH Keywords: convex hull
zbMATH Keywords: partially sorted set
MaRDI profile type: Publication
cites work: Parallel computational geometry
cites work: On the convex layers of a planar set
cites work: An optimal convex hull algorithm in any fixed dimension
cites work: Applications of random sampling in computational geometry. II
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: Q3772828
cites work: An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
cites work: Finding the convex hull of a sorted point set in parallel
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: Finding the convex hull of a simple polygon
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Q3992847
cites work: A Lower Bound to Finding Convex Hulls
description: scientific article; zbMATH DE number 220607