Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Theoretical and empirical analysis of a fast algorithm for extracting
  polygons from signed distance bounds   We investigate an asymptotically fast method for transforming signed distance
bounds into polygon meshes. This is achieved by combining sphere tracing (also
known as ray marching) and one of the traditional polygonization schemes (e.g.,
Marching cubes). Let us call this approach Gridhopping. We provide theoretical
and experimental evidence that it is of the $O(N^2\log N)$ computational
complexity for a polygonization grid with $N^3$ cells. The algorithm is tested
on both a set of primitive shapes as well as signed distance fields generated
from point clouds by machine learning. Given its speed, simplicity and
portability, we argue that it could prove useful during the modelling stage as
well as in shape compression for storage.
  The code is available here: https://github.com/nenadmarkus/gridhopping

29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
0
The categories of this paper are: hep-ph
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
31
The categories of this paper are: ao-sci