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 "simplified emanation graphs a sparse plane spanner with steiner points"):
  Abstract: Emanation graphs of grade $k$, introduced by Hamedmohseni, Rahmati, and Mondal, are plane spanners made by shooting $2^{k+1}$ rays from each given point, where the shorter rays stop the longer ones upon collision. The collision points are the Steiner points of the spanner. #R##N#We introduce a method of simplification for emanation graphs of grade $k=2$, which makes it a competent spanner for many possible use cases such as network visualization and geometric routing. In particular, the simplification reduces the number of Steiner points by half and also significantly decreases the total number of edges, without increasing the spanning ratio. Exact methods of simplification along with mathematical proofs on properties of the simplified graph is provided. #R##N#We compare simplified emanation graphs against Shewchuk's constrained Delaunay triangulations on both synthetic and real-life datasets. Our experimental results reveal that the simplified emanation graphs outperform constrained Delaunay triangulations in common quality measures (e.g., edge count, angular resolution, average degree, total edge length) while maintain a comparable spanning ratio and Steiner point count.

Includes members:
  Member "a new approach to graphmaps a system browsing large graphs as interactive maps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi level tree based approach for interactive graph visualization with semantic zoom")
  Member "gabriel triangulations and angle monotone graphs local routing and recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the area requirements of planar greedy drawings of triconnected planar graphs")
  Member "graphmaps browsing large graphs as interactive maps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low ply drawings of trees and 2 trees")
  Member "increasing chord graphs on point sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)