Piercing Pairwise Intersecting Geodesic Disks by Five Points

12/11/2021
by   A. Karim Abu-Affash, et al.
0

Given a simple polygon P on n vertices, and a set D of m pairwise intersecting geodesic disks in P, we show that five points in P are always sufficient to pierce all the disks in D. This improves the previous bound of 14, obtained by Bose, Carmi, and Shermer.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2018

Stabbing pairwise intersecting disks by five points

We present an O(n) expected time algorithm and an O(n n) deterministic ...
research
12/17/2018

Stabbing Pairwise Intersecting Disks by Four Points

Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981...
research
11/17/2021

On prescribing total preorders and linear orders to pairwise distances of points in Euclidean space

We show that any total preorder on a set with n2 elements coincides with...
research
11/02/2003

Which Point Configurations are Determined by the Distribution of their Pairwise Distances?

In a previous paper we showed that, for any n > m+2, most sets of n poin...
research
02/24/2021

A New Pairwise Deep Learning Feature For Environmental Microorganism Image Analysis

Environmental microorganism (EM) offers a high-efficient, harmless, and ...
research
06/05/2016

Pairwise Quantization

We consider the task of lossy compression of high-dimensional vectors th...
research
06/06/2023

From Key Points to Key Point Hierarchy: Structured and Expressive Opinion Summarization

Key Point Analysis (KPA) has been recently proposed for deriving fine-gr...

Please sign up or login with your details

Forgot password? Click here to reset