Finding the Intersection of a Set of n Half-Spaces in Time 0(nlogn)
Preparata, F.P.; Muller, D.E.
Permalink
https://hdl.handle.net/2142/74213
Description
Title Finding the Intersection of a Set of n Half-Spaces in Time 0(nlogn) Author(s) Preparata, F.P. Muller, D.E. Issue Date 1977-12 Keyword(s) Computational complexity Computational geometry Intersection of half-spaces Convex hull Extreme points Linear programming Geometric duality Publisher Applied Computation Theory Group, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign Series/Report Name or Number Coordinated Science Laboratory Report no. UILU-ENG 77-2250, R-803, ACT-7 Type of Resource text Language English Permalink http://hdl.handle.net/2142/74213 Sponsor(s)/Grant Number(s) National Science Foundation / MCS 76-17321 Joint Services Electronics Program / DAAB-07-72-C-0259
Owning Collections
