human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "On Monotone Drawings of Trees":
    also connected through other hyperedges:
      (none)

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics