human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "angle optimization of graphs embedded in the plane"):
  Abstract: In this paper we study problems of drawing graphs in the plane using edge length constraints and angle optimization. Specifically we consider the problem of maximizing the minimum angle, the MMA problem. We solve the MMA problem using a spring-embedding approach where two forces are applied to the vertices of the graph: a force optimizing edge lengths and a force optimizing angles. We solve analytically the problem of computing an optimal displacement of a graph vertex optimizing the angles between edges incident to it if the degree of the vertex is at most three. We also apply a numerical approach for computing the forces applied to vertices of higher degree. We implemented our algorithm in Java and present drawings of some graphs.

Includes members:
  Member "drawing trees with perfect angular resolution and polynomial area":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bipartite and series parallel graphs without planar lombardi drawings")
  Member "lombardi drawings of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bipartite and series parallel graphs without planar lombardi drawings")
  Member "maximizing the total resolution of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stress plus x spx graph layout")
  Member "optimal angular resolution for face symmetric drawings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph theoretic solutions to computational geometry problems")
  Member "trees with convex faces and optimal angles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "realization and connectivity of the graphs of origami flat foldings")
  Member "optimal point placement for mesh smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "consensus maximization tree search revisited")

Question: Please tell me which class the source paper 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)