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 "dynamic distribution sensitive point location"):
  Abstract: We propose a dynamic data structure for the distribution-sensitive point location problem. Suppose that there is a fixed query distribution in $\mathbb{R}^2$, and we are given an oracle that can return in $O(1)$ time the probability of a query point falling into a polygonal region of constant complexity. We can maintain a convex subdivision $\cal S$ with $n$ vertices such that each query is answered in $O(\mathrm{OPT})$ expected time, where OPT is the minimum expected time of the best linear decision tree for point location in $\cal S$. The space and construction time are $O(n\log^2 n)$. An update of $\cal S$ as a mixed sequence of $k$ edge insertions and deletions takes $O(k\log^5 n)$ amortized time. As a corollary, the randomized incremental construction of the Voronoi diagram of $n$ sites can be performed in $O(n\log^5 n)$ expected time so that, during the incremental construction, a nearest neighbor query at any time can be answered optimally with respect to the intermediate Voronoi diagram at that time.

Includes members:
  Member "point location in incremental planar subdivisions":
    also connected through other hyperedges:
      (none)
  Member "point location in dynamic planar subdivisions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "external memory planar point location with fast updates")
  Member "adaptive planar point location":
    also connected through other hyperedges:
      (none)
  Member "instance optimal geometric algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "instance optimality in the noisy value and comparison model accept accept strong accept which papers get in")
  Member "entropy triangulation and point location in planar subdivisions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distance sensitive planar point location")
  Member "a static optimality transformation with applications to planar point location":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the online min sum set cover problem")
  Member "odds on trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "instance optimal geometric algorithms")

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)