DOIAbstract
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
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
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
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...
Finding the convex hull of a finite set of points is important not only for practical applications b...
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in...
Motivated by the desire to cope with data imprecision [31], we study methods for taking advantage of...
AbstractLet X1…Xn be a sequence of independent Rd-valued random vectors with a common density ƒ. The...
AbstractIn this paper we give an optimal algorithm for constructing the convex hull of a partially s...
The construction of the convex hull of a finite point set in a low-dimensional Euclidean space is a...
The definition of the convex hull of a set of points is the smallest convex set containing all the p...
AbstractWe show that the convex hull of a set of discs can be determined in Θ(n log n) time. The alg...
In this dissertation, the author has made an attempt to study the performance characteristics of var...
All possible convex hull (i.e. the minimum area convex polygon containing the planar set) algorithms...
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
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...
Finding the convex hull of a finite set of points is important not only for practical applications b...
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in...
Motivated by the desire to cope with data imprecision [31], we study methods for taking advantage of...
AbstractLet X1…Xn be a sequence of independent Rd-valued random vectors with a common density ƒ. The...
AbstractIn this paper we give an optimal algorithm for constructing the convex hull of a partially s...
The construction of the convex hull of a finite point set in a low-dimensional Euclidean space is a...
The definition of the convex hull of a set of points is the smallest convex set containing all the p...
AbstractWe show that the convex hull of a set of discs can be determined in Θ(n log n) time. The alg...
In this dissertation, the author has made an attempt to study the performance characteristics of var...
All possible convex hull (i.e. the minimum area convex polygon containing the planar set) algorithms...
We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $...
AbstractThis paper presents a new algorithm for the convex hull problem, which is based on a reducti...
AbstractWe consider the computation of the convex hull of a given n-point set in three-dimensional E...
Add to ORKG