Output-sensitive results on convex hulls, extreme points, and related problems
type: Item
instance of: scholarly article
title: Output-sensitive results on convex hulls, extreme points, and related problems
zbMATH Open document ID: 0857.68112
DOI: 10.1007/BF02712874
author: Yanyan Li
published in: Discrete \& Computational Geometry
publication date: 1997-03-03T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 949872
zbMATH Keywords: ray-shooting
zbMATH Keywords: linear-programming queries
MaRDI profile type: Publication
cites work: Ray Shooting and Parametric Search
cites work: Dynamic half-space range reporting and its applications
cites work: On the Average Number of Maxima in a Set of Vectors and Applications
cites work: Decomposable searching problems I. Static-to-dynamic transformation
cites work: Optimal output-sensitive convex hull algorithms in two and three dimensions
cites work: Q4886058
cites work: An Algorithm for Convex Polytopes
cites work: On the convex layers of a planar set
cites work: Cutting hyperplanes for divide-and-conquer
cites work: Derandomizing an output-sensitive convex hull algorithm in three dimensions
cites work: Applications of random sampling in computational geometry. II
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Fast detection of polyhedral intersection
cites work: Q3772828
cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
cites work: An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
cites work: Constructing Belts in Two-Dimensional Arrangements with Applications
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: Linear Optimization Queries
cites work: On ray shooting in convex polytopes
cites work: The maximum numbers of faces of a convex polytope
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Enumerating extreme points in higher dimensions
cites work: Q4295776
cites work: Maintenance of configurations in the plane
cites work: Convex hulls of finite sets of points in two and three dimensions
cites work: Q3992847
cites work: Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
cites work: On the detection of a common intersection of k convex subjects in the plane
cites work: Q3823795
cites work: \(k\)-violation linear programming
cites work: Small-dimensional linear programming and convex hulls made easy
cites work: A combinatorial bound for linear programming and related problems
cites work: Finding the convex hull facet by facet
description: scientific article; zbMATH DE number 949872