1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2021
Non-uniform quantization with linear average-case computation time
Oswaldo Cadenas, Graham M. Megson
A new method for binning a set of data values into a set of m bins for the case where the bins are of different sizes is proposed. The method skips binning using a binary searc…
cs.CG2015
An Empirical Evaluation of Preconditioning Data for Accelerating Convex Hull Computations
José O. Cadenas, Graham Megson
The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of…
cs.CG2013★ 1 cited
A Rank-based Convex Hull method for Dense Data Sets
G. M. Megson, J. Cadenas
A novel 2-D method for computing the convex hull of a sufficiently dense set of n integer points is introduced. The approach employs a ranking function that avoids sorting the poin…