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 "untangling polygons and graphs"):
  Abstract: Untangling is a process in which some vertices in a drawing of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C n while keeping Ω(n 2/3) vertices fixed.#R##N##R##N#For any connected graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree, and diameter of G. One consequence is that every 3-connected planar graph has a drawing δ such that at most O((nlog n)2/3) vertices are fixed in every untangling of δ.

Includes members:
  Member "untangling a planar graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "a polynomial bound for untangling geometric planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "on collinear sets in straight line drawings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cubic planar graphs that cannot be drawn on few lines")
  Member "on the obfuscation complexity of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "moving vertices to make drawings plane":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometry and generation of a new graph planarity game")

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)