human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "kinetic voronoi diagrams and delaunay triangulations under polygonal distance functions"
  Abstract: Let $P$ be a set of $n$ points and $Q$ a convex $k$-gon in ${\mathbb R}^2$. We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and the Delaunay triangulation of $P$, under the convex distance function defined by $Q$, as the points of $P$ move along prespecified continuous trajectories. Assuming that each point of $P$ moves along an algebraic trajectory of bounded degree, we establish an upper bound of $O(k^4n\lambda_r(n))$ on the number of topological changes experienced by the diagrams throughout the motion; here $\lambda_r(n)$ is the maximum length of an $(n,r)$-Davenport-Schinzel sequence, and $r$ is a constant depending on the algebraic degree of the motion of the points. Finally, we describe an algorithm for efficiently maintaining the above structures, using the kinetic data structure (KDS) framework.

Connected through hyperedge HE-1 (induced by source paper "kinetic geodesic voronoi diagrams in a simple polygon"):
  with members:
    - "computing a geodesic two center of points in a simple polygon"
    - "voronoi diagrams for a moderate sized point set in a simple polygon"
    - "visibility graphs dismantlability and the cops and robbers game"
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"

Connected through hyperedge HE-2 (induced by source paper "polygon queries for convex hulls of points"):
  with members:
    - "minimum perimeter sum partitions in the plane"

Connected through hyperedge HE-3 (induced by source paper "stable delaunay graphs"):
  with members:
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"
    - "a simple faster method for kinetic proximity problems"
    - "on topological changes in the delaunay triangulation of moving points"
    - "kinetic stable delaunay graphs"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-4 (induced by source paper "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"):
  with members:
    - "on topological changes in the delaunay triangulation of moving points"
    - "kinetic stable delaunay graphs"
    - "a kinetic triangulation scheme for moving points in the plane"

Question: Please tell me which class the center node 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)