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: "approximate euclidean shortest paths amid polygonal obstacles"
  Abstract: Given a set \mathcal{P} of non-intersecting polygonal obstacles in \mathbb{R}^2 defined with n vertices, we compute a sketch \Omega of \mathcal{P} whose size is independent of n. We utilize \Omega to devise an algorithm to compute a (1+\epsilon)-approximate Euclidean shortest path between two points given with the description of \mathcal{P}. When \mathcal{P} comprises of convex polygonal obstacles, we devise a (2+\epsilon)-approximation algorithm to efficiently answer two-point Euclidean distance queries.

Connected through hyperedge HE-1 (induced by source paper "computing a rectilinear shortest path amid splinegons in plane"):
  with members:
    - "computing shortest paths among curved obstacles in the plane"
    - "a near optimal algorithm for finding euclidean shortest path in polygonal domain"

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)