Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A finite crisscross method for oriented matroids
Journal of Combinatorial Theory Series B
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions
Constant memory routing in quasi-planar and quasi-polyhedral graphs
Discrete Applied Mathematics
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
| Hi-index | 0.02 |