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 "computational geometry column 67"):
  Abstract: In the limited workspace model, we consider algorithms whose input resides in read-only memory and that use only a constant or sublinear amount of writable memory to accomplish their task. We survey recent results in computational geometry that fall into this model and that strive to achieve the lowest possible running time. In addition to discussing the state of the art, we give some illustrative examples and mention open problems for further research.

Includes members:
  Member "common tangents of two disjoint polygons in linear time and constant workspace":
    also connected through other hyperedges:
      (none)
  Member "time space trade off for finding the k visibility region of a point in a polygon":
    also connected through other hyperedges:
      (none)
  Member "an experimental study of algorithms for geodesic shortest paths in the constant workspace model":
    also connected through other hyperedges:
      (none)
  Member "improved time space trade offs for computing voronoi diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "space efficient algorithms for breadth depth search")
  Member "ime space trade offs for computing euclidean minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new balanced subdivision of a simple polygon for time space trade off algorithms")
  Member "time space trade offs for triangulations and voronoi diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a new balanced subdivision of a simple polygon for time space trade off algorithms")
  Member "experimental study of compressed stack algorithms in limited memory environments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an experimental study of algorithms for geodesic shortest paths in the constant workspace model")
  Member "outer common tangents and nesting of convex hulls in linear time and constant workspace":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")

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)