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 "largest and smallest area triangles on a given set of imprecise points"):
  Abstract: In this paper we study the following problem: we are given a set of imprecise points modeled as parallel line segments, and we wish to place a point on each line segment such that the resulting point set maximizes/minimizes the size of the largest/smallest area $k$-gon. We first study the problem for the case $k=3$. We show that for a given set of parallel line segments of equal length the largest possible area triangle can be found in $O(n \log n)$ time, and for line segments of arbitrary length the problem can be solved in $O(n^2)$ time. Also, we show that the smallest largest-area triangle can be found in $O(n^2 \log n)$ time. As for finding smallest-area triangles, we show that finding the largest smallest-area triangle is NP-hard, but that the smallest possible area triangle for a set of arbitrary length parallel line segments can be found in $O(n^2)$ time. Finally, we discuss to what extent our results can be generalized to larger values of $k$.

Includes members:
  Member "maximal area triangles in a convex polygon":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "largest inscribed rectangles in geometric convex sets")
  Member "a linear time algorithm for the maximum area inscribed triangle in a convex polygon":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximum area triangle in a convex polygon revisited")
  Member "new results on stabbing segments with a polygon":
    also connected through other hyperedges:
      (none)
  Member "covering and piercing disks with two centers":
    also connected through other hyperedges:
      (none)

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)