human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Monotone Drawings of 3-Connected Plane Graphs"
  Abstract: A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists a path P uw in G that is monotone on some line l uw . (Namely, the order of the orthogonal projections of the vertices in P uw on l uw is the same as the order they appear in P uw .) In this paper, we show that the classical Schnyder drawing of 3-connected plane graphs is a monotone drawing on a grid of size f ×f (f ≤ 2n − 5 is the number of internal faces of G), which can be constructed in O(n) time. It also has the advantage that, for any given vertices u,w, the monotone line l uw can be identified in O(1) time.

Connected through hyperedge HE-1 (induced by source paper "On Monotone Drawings of Trees"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics