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 "the continuous 1 5d terrain guarding problem discretization optimal solutions and ptas"):
  Abstract: In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an $x$-monotone chain of line segments in $\mathbb{R}^2$ (the terrain $T$) and ask for the minimum number of guards (located anywhere on $T$) required to guard all of $T$. We construct guard candidate and witness sets $G, W \subset T$ of polynomial size such that any feasible (optimal) guard cover $G^* \subseteq G$ for $W$ is also feasible (optimal) for the continuous TGP. This discretization allows us to (1) settle NP-completeness for the continuous TGP, (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the PTAS for the discrete TGP by Gibson et al., and (3) formulate the continuous TGP as an Integer Linear Program (IP). Furthermore, we propose several filtering techniques reducing the size of our discretization, allowing us to devise an efficient IP-based algorithm that reliably provides optimal guard placements for terrains with up to $10^6$ vertices within minutes on a standard desktop computer.

Includes members:
  Member "engineering art galleries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the parameterized complexity of guarding almost convex polygons")
  Member "efficient computation of visibility polygons":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "engineering art galleries")
  Member "algorithms for art gallery illumination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "engineering art galleries")
  Member "a ptas for the continuous 1 5d terrain guarding problem":
    also connected through other hyperedges:
      (none)
  Member "facets for art gallery problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "universal guard problems")
  Member "terrain visibility with multiple viewpoints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "altitude terrain guarding and guarding uni monotone polygons")
  Member "a generic lazy evaluation scheme for exact geometric computations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "engineering art galleries")
  Member "improved approximation algorithms for geometric set cover":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the epsilon t net problem")

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)