Buscar
Mostrando ítems 1-7 de 7
Artículo
Maximum Box Problem on Stochastic Points
(Springer, 2021-10)
Given a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ...
Artículo
The class cover problem with boxes
(Elsevier, 2012)
In this paper we study the following problem: Given sets R and B of r red and b blue points respectively in the plane, find a minimum-cardinality set H of axis-aligned rectangles (boxes) so that every point in B is covered ...
Artículo
Fitting a two-joint orthogonal chain to a point set
(Elsevier, 2010)
We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the objective function is to minimize the maximum orthogonal distance from S to the chain. We show that ...
Artículo
Covering point sets with two disjoint disks or squares
(Elsevier, 2007)
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red points covered by CR plus the number of ...
Artículo
On finding widest empty curved corridors
(Elsevier, 2007)
An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle ...
Artículo
Scaling and compressing melodies using geometric similarity measures
(Elsevier, 2022-08)
Melodic similarity measurement is of key importance in Music Information Retrieval. In this paper, we use geometric matching techniques to measure the similarity between two monophonic melodies. We propose efficient ...
Artículo
Constrained many-to-many point matching in two dimensions
(Springer, 2024-01-26)
In the minimum-weight many-to-many point matching problem, we are given a set R of red points and a set B of blue points in the plane, of total size N, and we want to pair up each point in R to one or more points in B and ...