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 "unions of onions preprocessing imprecise points for fast onion decomposition"):
  Abstract: Let  D  be a set of  n  pairwise disjoint unit disks in the plane. We describe how to build a data structure for  D  so that for any point set  P  containing exactly one point from each disk, we can quickly find the onion decomposition (convex layers) of  P .  Our data structure can be built in  O ( n  log  n ) time and has linear size. Given  P , we can find its onion decomposition in  O ( n log  k ) time, where  k  is the number of layers. We also provide a matching lower bound.  Our solution is based on a recursive space decomposition, combined with a fast algorithm to compute the union of two disjoint onion decompositions.

Includes members:
  Member "halving balls in deterministic linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "balanced line separators of unit disk graphs")
  Member "convex hull of points lying on lines in o nlogn time after preprocessing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for robust realistic geometric computations")
  Member "self improving algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learned frequency estimation algorithms under zipfian distribution")

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)