Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A linear-time algorithm for the maximum-area inscribed triangle in a
  convex polygon   Given the n vertices of a convex polygon in cyclic order, can the triangle of
maximum area inscribed in P be determined by an algorithm with O(n) time
complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979
has recently been shown to be incorrect by Keikha, L\"offler, Urhausen, and van
der Hoog. These authors give an alternative algorithm with O(n log n) time
complexity. Here we give an algorithm with linear time complexity.

19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
15
The categories of this paper are: nucl-ex