Name
Abstract | ||
|---|---|---|
We study the computation of the diameter and radius under the rectilinear link distance within a rectilinear polygonal domain of $n$ vertices and $h$ holes. We introduce a emph{graph of oriented distances} to encode the distance between pairs of points of the domain. This helps us transform the problem so that we can search through the candidates more efficiently. Our algorithm computes both the diameter and the radius in $min {,O(n^omega), O(n^2 + nh log h + chi^2),}$ time, where $omegau003c2.373$ denotes the matrix multiplication exponent and $chiin Omega(n)cap O(n^2)$ is the number of edges of the graph of oriented distances. We also provide a faster algorithm for computing the diameter that runs in $O(n^2 log n)$ time. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Computational Geometry | Binary logarithm,Discrete mathematics,Graph,Combinatorics,Polygon,Exponent,Vertex (geometry),Omega,Matrix multiplication,Mathematics,Computation |
DocType | Volume | Citations |
Journal | abs/1712.05538 | 0 |
PageRank | References | Authors |
0.34 | 10 | 8 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Man-Kwun Chiu | 1 | 14 | 6.13 |
| Elena Khramtcova | 2 | 7 | 4.24 |
| Matias Korman | 3 | 178 | 37.28 |
| Aleksandar Markovic | 4 | 2 | 2.76 |
| Yoshio Okamoto | 5 | 15 | 2.71 |
| Aurélien Ooms | 6 | 0 | 1.01 |
| André van Renssen | 7 | 104 | 19.30 |
| Marcel Roeloffzen | 8 | 3 | 3.84 |