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 "drawing planar graphs with few segments on a polynomial grid"):
  Abstract: The visual complexity of a plane graph drawing is defined to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path with an arbitrary number of edges). A crossing-free straight-line drawing of a graph is called monotone if there is a monotone path between any pair of vertices with respect to some direction. We study drawings of trees, outerplanar graphs, and general planar graphs with few segments on a polynomial size grid. For trees, the grid size is $n\times n$. For 3-connected planar graphs and biconnected outerplanar graphs, we compute such drawings that are also monotone.

Includes members:
  Member "drawing planar graphs with few geometric primitives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "variants of the segment number of a graph")
  Member "drawing graphs on few circles and few spheres":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drawing planar graphs with few geometric primitives")
  Member "experimental analysis of the accessibility of drawings with few segments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "level planar drawings with few slopes")
  Member "optimal monotone drawings of trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drawing graphs as spanners")
  Member "the complexity of drawing graphs on few lines and few planes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal curve straightening is exists mathbb r complete")
  Member "strongly monotone drawings of planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drawing graphs as spanners")
  Member "drawing graphs on few lines and few planes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "variants of the segment number of a graph")
  Member "on monotone drawings of trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "drawing graphs as spanners")

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)