human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "an upper bound for min max angle of polygons"
  Abstract: Let $S$ be a set of points in the plane, $CH$ be the convex hull of $S$, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that $\theta\leq 2\pi-\frac{2\pi}{r.m}$ such that $m$ and $r$ are the number of edges and internal points of $CH$, respectively. We also introduce an innovative polynomial time algorithm to construct a polygon with the said upper bound on its angles. Constructing a simple polygon with angular constraint on a given set of points in the plane is highly applicable to the fields of robotics, path planning, image processing, GIS, etc. Moreover, we improve our upper bound on $\theta$ and prove that this is tight.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CG(Computational Geometry)