AbstractAn n log n lower bound is found for linear decision tree algorithms with integer inputs that either identify the convex hull of a set of points or compute its cardinality
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in...
AbstractGiven a convex body C in the plane, its discrete hull is C0 = ConvexHull(C ∩ L), where L = Z...
AbstractAn n log n lower bound is found for linear decision tree algorithms with integer inputs that...
We show that any parallel algorithm in the fixed degree algebraic decision tree model that answers m...
Motivated by the desire to cope with data imprecision [31], we study methods for taking advantage of...
AbstractWe present lower bounds on the number of rounds required to solve a decision problem in the ...
The construction of the convex hull of a finite point set in a low-dimensional Euclidean space is a...
Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed...
Finding the convex hull of a finite set of points is important not only for practical applications b...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
AbstractIn this paper, two linear programming formulations of the convex hull problem are presented....
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
In this article we study convex integer maximization problems with com-posite objective functions of...
Computational geometry is, in brief, the study of algorithms for geometric problems. Classical study...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in...
AbstractGiven a convex body C in the plane, its discrete hull is C0 = ConvexHull(C ∩ L), where L = Z...
AbstractAn n log n lower bound is found for linear decision tree algorithms with integer inputs that...
We show that any parallel algorithm in the fixed degree algebraic decision tree model that answers m...
Motivated by the desire to cope with data imprecision [31], we study methods for taking advantage of...
AbstractWe present lower bounds on the number of rounds required to solve a decision problem in the ...
The construction of the convex hull of a finite point set in a low-dimensional Euclidean space is a...
Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed...
Finding the convex hull of a finite set of points is important not only for practical applications b...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
AbstractIn this paper, two linear programming formulations of the convex hull problem are presented....
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
In this article we study convex integer maximization problems with com-posite objective functions of...
Computational geometry is, in brief, the study of algorithms for geometric problems. Classical study...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in...
AbstractGiven a convex body C in the plane, its discrete hull is C0 = ConvexHull(C ∩ L), where L = Z...
DOI
Add to ORKG