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 "windrose planarity embedding graphs with direction constrained edges"):
  Abstract: Given a planar graph G and a partition of the neighbors of each vertex v in four sets vn, vn, vs, and vs, the problem Windrose Planarity asks to decide whether G admits a windrose-planar drawing, that is, a planar drawing in which (i) each neighbor u ∈ vnv is above and to the right of v, (ii) each neighbor u ∈ vn is above and to the left of v, (iii) each neighbor u ∈ vs is below and to the left of v, (iv) each neighbor u ∈ vs is below and to the right of v, and (v) edges are represented by curves that are monotone with respect to each axis. By exploiting both the horizontal and the vertical relationship among vertices, windrose-planar drawings allow us to simultaneously visualize two partial orders defined by means of the edges of the graph. #R##N##R##N#Although the problem is NP-hard in the general case, we give a polynomial-time algorithm for testing whether there exists a windrose-planar drawing that respects a given combinatorial embedding. This algorithm is based on a characterization of the plane triangulations admitting a windrose-planar drawing. Furthermore, for any embedded graph with n vertices that has a windrose-planar drawing, we can construct one with at most one bend per edge and with at most 2n−5 bends in total, which lies on the 3n × 3n grid. The latter result contrasts with the fact that straight-line windrose-planar drawings may require exponential area.

Includes members:
  Member "ordered level planarity geodesic planarity and bi monotonicity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extending upward planar graph drawings")
  Member "bitonic st orderings for upward planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal slope sets for upward planar drawings")
  Member "advances on testing c planarity of embedded flat clustered graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "relaxing the constraints of clustered planarity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "multiple source multiple sink maximum flow in directed planar graphs in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum cuts in surface graphs")

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)