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 "outer common tangents and nesting of convex hulls in linear time and constant workspace"):
  Abstract: We describe the first algorithm to compute the outer common tangents of two disjoint simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies on the same side of the line. An outer common tangent of two polygons is a tangent of both polygons such that the polygons lie on the same side of the tangent. Each polygon is given as a read-only array of its corners in cyclic order. The algorithm detects if an outer common tangent does not exist, which is the case if and only if the convex hull of one of the polygons is contained in the convex hull of the other. Otherwise, two corners defining an outer common tangent are returned.

Includes members:
  Member "minimum perimeter sum partitions in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")
  Member "memory adjustable navigation piles with applications to sorting and convex hulls":
    also connected through other hyperedges:
      (none)
  Member "time space trade off algorithms for triangulating a simple polygon":
    also connected through other hyperedges:
      (none)
  Member "space efficient plane sweep algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient biconnected components and recognition of outerplanar graphs")
  Member "an optimal algorithm for the separating common tangents of two polygons":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")
  Member "shortest path in a polygon using sublinear space":
    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 "memory constrained algorithms for simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time space trade off for finding the k visibility region of a point in a polygon")

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)