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 "optimally fast incremental manhattan plane embedding and planar tight span construction"):
  Abstract: We describe a data structure, a rectangular complex, that can be used represent hyperconvex metric spaces that have the same topology (although not necessarily the same distance function) as subsets of the plane. We show how to use this data structure to construct the tight span of a metric space given as an  n × n  distance matrix, when the tight span is homeomorphic to a subset of the plane, in time  O ( n  2 ), and to add a single point to a planar tight span in time O ( n ). As an application of this construction, we show how to test whether a given ﬁnite metric space embeds isometrically into the Manhattan plane in time O( n  2 ), and add a single point to the space and re-test whether it has such an embedding in time  O ( n ).

Includes members:
  Member "bounds on the complexity of halfspace intersections when the bounded faces have small dimension":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "treetopes and their graphs")
  Member "embedding into the rectilinear plane in optimal o n2 time":
    also connected through other hyperedges:
      (none)
  Member "optimal embedding into star metrics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multiple source shortest paths in embedded graphs")

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)