Optimal Construction for Time-Convex Hull with Two Orthogonal Highways in the L1-metric

06/30/2021
by   Jyun-Yu Chen, et al.
0

We consider the time-convex hull problem in the presence of two orthogonal highways H. In this problem, the travelling speed on the highway is faster than off the highway, and the time-convex hull of a point set P is the closure of P with respect to the inclusion of shortest time-paths. In this paper, we provide the algorithm for constructing the time-convex hull with two orthogonal highways. We reach the optimal result of O(n log n) time for arbitrary highway speed in the L1-metric. For the L2-metric with infinite highway speed, we hit the goal of O(n log n) time as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2022

Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision

There are many space subdivision and space partitioning techniques used ...
research
12/06/2021

Voronoi Diagrams in the Hilbert Metric

The Hilbert metric is a distance function defined for points lying withi...
research
08/26/2022

Polar, Spherical and Orthogonal Space Subdivisions for an Algorithm Acceleration: O(1) Point-in-Polygon/Polyhedron Test

Acceleration of algorithms is becoming a crucial problem, if larger data...
research
10/23/2020

Geometric Separability using Orthogonal Objects

Given a bichromatic point set P=R ∪ B of red and blue points, a separato...
research
04/30/2018

A Linear-Time Approximation Algorithm for the Orthogonal Terrain Guarding Problem

In this paper, we consider the 1.5-dimensional orthogonal terrain guardi...
research
04/26/2023

Covering simple orthogonal polygons with r-stars

We solve the r-star covering problem in simple orthogonal polygons, also...

Please sign up or login with your details

Forgot password? Click here to reset