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 "diffuse reflection radius in a simple polygon"):
  Abstract: It is shown that every simple polygon in general position with $n$ walls can be illuminated from a single point light source $s$ after at most $\lfloor (n-2)/4\rfloor$ diffuse reflections, and this bound is the best possible. A point $s$ with this property can be computed in $O(n\log n)$ time. It is also shown that the minimum number of diffuse reflections needed to illuminate a given simple polygon from a single point can be approximated up to an additive constant in polynomial time.

Includes members:
  Member "a linear time algorithm for the geodesic center of a simple polygon":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a time space trade off for computing the geodesic center of a simple polygon")
  Member "an algorithm for computing constrained reflection paths in simple polygon":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of minimum link path problems")
  Member "computing the l_1 geodesic diameter and center of a simple polygon in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a linear time algorithm for the geodesic center of a simple polygon")
  Member "weak visibility queries of line segments in simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quickest visibility queries in polygonal domains")

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)