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 "graph theoretic solutions to computational geometry problems"):
  Abstract: Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm depends on the special properties of the graph constructed in this way. We survey the art gallery problem, partition into rectangles, minimum-diameter clustering, rectilinear cartogram construction, mesh stripification, angle optimization in tilings, and metric embedding from this perspective.

Includes members:
  Member "orientation constrained rectangular layouts":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adjacency preserving spatial treemaps")
  Member "optimal angular resolution for face symmetric drawings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle optimization of graphs embedded in the plane")
  Member "area universal rectangular layouts":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing stable demers cartograms")
  Member "testing bipartiteness of geometric intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometric biplane graphs i maximal graphs")
  Member "optimal embedding into star metrics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiple source shortest paths in embedded graphs")
  Member "trees with convex faces and optimal angles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "realization and connectivity of the graphs of origami flat foldings")
  Member "algorithms for drawing media":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "drawing arrangement graphs in small grids or how to play planarity")
  Member "the traveling salesman problem for cubic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an exact algorithm for tsp in degree 3 graphs via circuit procedure and amortization on connectivity structure")

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)