Scenic Routes over Points in 2D Space

06/08/2023
by   Loay Rashid, et al.
0

Consider a 2D coordinate space with a set of red and a set of blue points. We define a scenic point as a point that is equidistant to a red point and a blue point. The set of contiguous scenic points form a scenic path. The perpendicular bisectors to the line joining a red point and a blue point forms a scenic path between the red point and the blue point. A scenic route is a traversal made from scenic paths. In this paper, we address this novel problem by (i) designing algorithms for scenic route generation, (ii) studying the algorithms different properties and (iii) analyzing the routes generated by these algorithms. Scenic routes have applications in geo-spatial visualizations and visual analytics.

READ FULL TEXT

page 2

page 7

research
08/03/2017

On balanced 4-holes in bichromatic point sets

Let S=R∪ B be a point set in the plane in general position such that eac...
research
06/08/2023

Scenic Routes with Weighted Points in 2D

In a given 2D space, we can have points with different levels of importa...
research
06/26/2023

Scenic Routes in R^d

In this work, we introduce the problem of scenic routes among points in ...
research
06/09/2020

Towards Generating Benchmark Datasets for Worm Infection Studies

Worm origin identification and propagation path reconstruction are among...
research
06/01/2021

Strobe: An Acceleration Meta-algorithm for Optimizing Robot Paths using Concurrent Interleaved Sub-Epoch Pods

In this paper, we present a meta-algorithm intended to accelerate many e...
research
07/12/2019

On circles enclosing many points

We prove that every set of n red and n blue points in the plane contains...
research
02/03/2022

k-Transmitter Watchman Routes

We consider the watchman route problem for a k-transmitter watchman: sta...

Please sign up or login with your details

Forgot password? Click here to reset