An Instance-optimal Algorithm for Bichromatic Rectangular Visibility

06/10/2021
by   Jean Cardinal, et al.
0

Afshani, Barbay and Chan (2017) introduced the notion of instance-optimal algorithm in the order-oblivious setting. An algorithm A is instance-optimal in the order-oblivious setting for a certain class of algorithms A* if the following hold: - A takes as input a sequence of objects from some domain; - for any instance σ and any algorithm A' in A*, the runtime of A on σ is at most a constant factor removed from the runtime of A' on the worst possible permutation of σ. If we identify permutations of a sequence as representing the same instance, this essentially states that A is optimal on every possible input (and not only in the worst case). We design instance-optimal algorithms for the problem of reporting, given a bichromatic set of points in the plane S, all pairs consisting of points of different color which span an empty axis-aligned rectangle (or reporting all points which appear in such a pair). This problem has applications for training-set reduction in nearest-neighbour classifiers. It is also related to the problem consisting of finding the decision boundaries of a euclidean nearest-neighbour classifier, for which Bremner et al. (2005) gave an optimal output-sensitive algorithm. By showing the existence of an instance-optimal algorithm in the order-oblivious setting for this problem we push the methods of Afshani et al. closer to their limits by adapting and extending them to a setting which exhibits highly non-local features. Previous problems for which instance-optimal algorithms were proven to exist were based solely on local relationships between points in a set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2023

On the Restricted k-Steiner Tree Problem

Given a set P of n points in ℝ^2 and an input line γ in ℝ^2, we present ...
research
11/04/2022

Extension of Simple Algorithms to the Matroid Secretary Problem

Whereas there are simple algorithms that are proven to be optimal for th...
research
06/21/2018

Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?

Motivated by crowdsourced computation, peer-grading, and recommendation ...
research
01/15/2021

Preprocessing Imprecise Points for the Pareto Front

In the preprocessing model for uncertain data we are given a set of regi...
research
07/14/2022

A Query-Optimal Algorithm for Finding Counterfactuals

We design an algorithm for finding counterfactuals with strong theoretic...
research
10/31/2020

Optimal 1-NN Prototypes for Pathological Geometries

Using prototype methods to reduce the size of training datasets can dras...
research
10/21/1999

Finite-resolution hidden surface removal

We propose a hybrid image-space/object-space solution to the classical h...

Please sign up or login with your details

Forgot password? Click here to reset