Showing cs.CGShow all
2 papers · 1 filter
cs.CG2018
Computing Coverage Kernels Under Restricted Settings
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
We consider the Minimum Coverage Kernel problem: given a set of -dimensional boxes, find a subset of of minimum size covering the same region as . This problem is $\m…
cs.CG2017
Depth Distribution in High Dimensions
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set of axis aligned boxes, whose computation gene…