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 "on the computation of zone and double zone diagrams"):
  Abstract: Classical objects in computational geometry are defined by explicit relations. Several years ago the pioneering works of Asano, Matousek and Tokuyama introduced “implicit computational geometry” in which the geometric objects are defined by implicit relations involving sets. An important member in this family is called “a zone diagram”. The implicit nature of zone diagrams implies, as has already been observed in the original works, that their computation is a challenging task. In a continuous setting this task has been addressed (briefly) only by these authors in the Euclidean plane with point sites. We discuss the possibility to compute zone diagrams in a wide class of spaces and also shed new light on their computation in the original setting. The class of spaces, which is introduced here, includes, in particular, Euclidean spheres and finite-dimensional strictly convex normed spaces. Sites of a general form are allowed and it is shown that a generalization of the iterative method suggested by Asano, Matousek and Tokuyama converges to a double zone diagram, another implicit geometric object whose existence is known in general. Occasionally a zone diagram can be obtained from this procedure. The actual (approximate) computation of the iterations is based on a simple algorithm which enables the approximate computation of Voronoi diagrams in a general setting. Our analysis also yields a few byproducts of independent interest, such as certain topological properties of Voronoi cells (e.g., that in the considered setting their boundaries cannot be “fat”).

Includes members:
  Member "on the possibility of simple parallel computing of voronoi diagrams and delaunay graphs":
    also connected through other hyperedges:
      (none)
  Member "the projector algorithm a simple parallel algorithm for computing voronoi diagrams and delaunay graphs":
    also connected through other hyperedges:
      (none)
  Member "the geometric stability of voronoi diagrams in normed spaces which are not uniformly convex":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "clustering in hilbert simplex geometry")
  Member "zone diagrams in euclidean spaces and in other normed spaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity theory for operators in analysis")
  Member "the geometric stability of voronoi diagrams with respect to small changes of the sites":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "persistent homology as stopping criterion for voronoi interpolation")
  Member "distance k sectors exist":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complexity theory for operators in analysis")

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)