Dispersion on Intervals.
Given a set of n disjoint intervals on a line, and an integer k, we want to find k points in the
intervals so that the minimum pairwise distance of the k points is maximized. Intuitively …
intervals so that the minimum pairwise distance of the k points is maximized. Intuitively …
[HTML][HTML] The dispersive art gallery problem
C Rieck, C Scheffer - Computational Geometry, 2024 - Elsevier
We introduce a new variant of the art gallery problem that comes from safety issues. In this
variant we are not interested in guard sets of smallest cardinality, but in guard sets with …
variant we are not interested in guard sets of smallest cardinality, but in guard sets with …
Dispersion in a Polygon
The dispersion problem is a variant of facility location problems, that has been extensively
studied. Given a polygon with 𝑛 edges on a plane we want to find 𝑘 points in the polygon so …
studied. Given a polygon with 𝑛 edges on a plane we want to find 𝑘 points in the polygon so …
Computing realistic terrains from imprecise elevations
GR Stroud - 2022 - uwspace.uwaterloo.ca
It is ideal for triangulated terrains to have characteristics or properties that are realistic. In the
imprecise terrain model, each vertex of a triangulated terrain has an imprecise eleva-tion …
imprecise terrain model, each vertex of a triangulated terrain has an imprecise eleva-tion …
Dispersion on intervals
Given a set of n disjoint intervals on a line and an integer k, we want to find k points in the
intervals so that the minimum pairwise distance of the k points is maximized. Intuitively …
intervals so that the minimum pairwise distance of the k points is maximized. Intuitively …