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 "time space trade off for finding the k visibility region of a point in a polygon"):
  Abstract: We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with \(O(\log {n})\) bits each. An algorithm can read and write O(s) additional words of workspace during its execution, and it writes its output to write-only memory. In a given polygon P and for a given point \(q \in P\), we say that a point p is inside the k-visibility region of q, if and only if the line segment pq intersects the boundary of P at most k times. Given a simple n-vertex polygon P stored in a read-only input array and a point \(q \in P\), we give a time-space trade-off algorithm which reports the k-visibility region of q in P in \(O(cn/s+n\log {s}+ \min \{{\lceil k/s \rceil n,n \log {\log _s{n}}}\})\) expected time using O(s) words of workspace. Here \(c\le n\) is the number of critical vertices for q, i.e., the vertices of P where the visibility region may change. We also show how to generalize this result for polygons with holes and for sets of non-crossing line segments.

Includes members:
  Member "modem illumination of monotone polygons":
    also connected through other hyperedges:
      (none)
  Member "memory constrained algorithms for simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an experimental study of algorithms for geodesic shortest paths in the constant workspace model")
  Member "space time trade offs for stack based algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")
  Member "computing a visibility polygon using few variables":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational geometry column 67")

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)