• Corpus ID: 15556991

On k-Enclosing Objects in a Coloured Point Set

@inproceedings{Barba2013OnKO,
  title={On k-Enclosing Objects in a Coloured Point Set},
  author={Luis Barba and Stephane Durocher and Robert Fraser and Ferran Hurtado and Saeed Mehrabi and Debajyoti Mondal and Jason Morrison and Matthew Skala and Mohammad Abdul Wahid},
  booktitle={CCCG},
  year={2013}
}
We introduce the exact coloured k -enclosing object problem: given a set P of n points in R 2 , each of which has an associated colour in f 1 ;:::;t g , and a vec- tor c = ( c 1 ;:::;c t ), where c i 2 Z + for each 1 i t , nd a region that contains exactly c i points of P of colour i for each i . We examine the problems of nd- ing exact coloured k -enclosing axis-aligned rectangles, squares, discs, and two-sided dominating regions in a t… 

Figures from this paper

Shortest Color-Spanning Intervals
TLDR
An improved algorithm with running time of O(n 2) for SCSI-2 with arbitrary s i ≥ 1 with fixed-parameter tractable with k as the parameter is presented and admits an exact algorithm running in O(2 k n· max {k,logn}) time.
Shortest color-spanning intervals
Effiiently computing the smallest axis-parallel squares spanning all colors
TLDR
This paper considers the problem of maintaining the smallest color-spanning interval for a set of n points with k colors on the real line, such that the insertion and deletion of an arbitrary point takes O(log2 n) the worst-case time, and exploits the data structure to show that there is O(n log2 n).
Stabbing segments with rectilinear objects
Stabbing segments with rectilinear objects
TLDR
This work provides efficient algorithms for reporting all combinatorially different stabbing regions for S for regions that can be described as the intersection of axis-parallel halfplanes; these are halfplanes, strips, quadrants, 3-sided rectangles, and rectangles.
Smallest k-Enclosing Rectangle Revisited
TLDR
The first near quadratic time algorithm for this problem is presented, improving over the previous near- O(n^{5/2}) O ( n 5 / 2 ) -time algorithm by Kaplan et al.
Smallest k-Enclosing Rectangle Revisited
TLDR
The first near quadratic time algorithm for this problem is presented, improving over the previous near-$O(n^{5/2})$-time algorithm by Kaplan etal [KRS17], and an almost matching conditional lower bound is provided.
Mexican Conference on Discrete Mathematics and Computational Geometry Stabbing Segments with Rectilinear Objects
TLDR
This paper considers the case in which the stabber can be described as the intersection of isothetic halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles).
Indexed Geometric Jumbled Pattern Matching
We consider how to preprocess n colored points in the plane such that later, given a multiset of colors, we can quickly find an axis-aligned rectangle containing a subset of the points with exactly
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
Enclosing k Points in the Smallest Axis Parallel Rectangle
Smallest Color-Spanning Object Revisited
TLDR
A dynamic version of the problem is studied, where new points may be added, and the narrowest color-spanning corridor at any instance can be reported in O(mn(α(n))2log m) time.
Computing the Smallest k-Enclosing Circle and Related Problems
We present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) problem: Given a set of n points in the plane and an integer k ≤ n, find the smallest disk containing k of the
Translating a Star over a Point Set
TLDR
This work designs algorithms to compute placements of~ R that maximize or minimize the number of k-occupied cones of ~ R, a set of m rays emanating from a point p such that the angle between two consecutive rays is 2π/m.
Minimum Separating Circle for Bichromatic Points in the Plane
TLDR
This paper shows how to find the minimum separating circle, which is the smallest circle that contains all points of the red set and as few points as possible of the blue set in its interior.
The upper envelope of Voronoi surfaces and its applications
TLDR
Borders on the number of vertices on the upper envelope of a collection of Voronoi surfaces are derived, and efficient algorithms to calculate these vertices are provided.
k-Enclosing Axis-Parallel Square
TLDR
An efficient algorithm to compute the smallest square containing at least k points of P for large values of k is presented using O(n) space which is the best known bound for worst case time complexity.
Iterated nearest neighbors and finding minimal polytopes
We introduce a new method for finding several types of optimalk-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of theO(k) nearest neighbors to each
Static and Dynamic Algorithms for k-Point Clustering Problems
TLDR
A unified approach is given for solving the problem of finding a sub set of S of size k that mjnimizes some closeness measure, such as the diameter, perimeter or the circumradius.
A linear-time algorithm for a special case of disjoint set union
TLDR
A linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance, which gives similar improvements in the efficiency of algorithms for solving a number of other problems.
...
1
2
3
4
...