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 "t shape visibility representations of 1 planar graphs"):
  Abstract: Abstract   A shape visibility representation displays a graph so that each vertex is represented by an orthogonal polygon of a particular shape and for each edge there is a horizontal or vertical line of sight of width    ϵ  >  0    between the polygons assigned to its endvertices. Special shapes are rectangles,  L ,  T ,  E , and  H -shapes, and caterpillars. A graph is 1-planar if there is a drawing in the plane such that each edge is crossed at most once and is IC-planar if in addition no two crossed edges share a vertex.  We show that every IC-planar graph has a flat rectangle visibility representation, in which each rectangle has height ϵ, and that every 1-planar graph has a  T -shape visibility representation. The representations use quadratic area and can be computed in linear time from a given embedding.

Includes members:
  Member "recognizing optimal 1 planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fan crossing free graphs")
  Member "nic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fan crossing free graphs")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fan crossing free graphs")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "ortho polygon visibility representations of embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "simultaneous visibility representations of plane st graphs using l shapes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the quasefe problem")
  Member "on 4 map graphs and 1 planar graphs and their recognition problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "recognizing optimal 1 planar graphs in linear time")
  Member "l visibility drawings of ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on graph drawing beyond planarity")

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)