A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Enumeration of regular triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Enumerating extreme points in higher dimensions
Nordic Journal of Computing
Journal of Functional Programming
A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem
Journal of Global Optimization
A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem
Journal of Global Optimization
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Solution of the laminated plate design problem: new problems and algorithms
Computers and Structures
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Operations Research Letters
| Hi-index | 0.00 |
An optimal algorithm for computing hyperplane cuttings is given. It results in a new kind of cutting, which enjoys all the properties of the previous ones and, in addition, can be refined by composition. An optimal algorithm for computing the convex hull of a finite point set in any fixed dimension is also given.