Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Scalable Isocontour Visualization in Road Networks via Minimum-Link
  Paths   Isocontours in road networks represent the area that is reachable from a
source within a given resource limit. We study the problem of computing
accurate isocontours in realistic, large-scale networks. We propose polygons
with minimum number of segments that separate reachable and unreachable
components of the network. Since the resulting problem is not known to be
solvable in polynomial time, we introduce several heuristics that are simple
enough to be implemented in practice. A key ingredient is a new practical
linear-time algorithm for minimum-link paths in simple polygons. Experiments in
a challenging realistic setting show excellent performance of our algorithms in
practice, answering queries in a few milliseconds on average even for long
ranges.

0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc
33
The categories of this paper are: plasm-ph
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th