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 "simple curve embedding"):
  Abstract: Given a curve f and a surface S, how hard is it to find a simple curve f' in S that is the most similar to f? #R##N#We introduce and study this simple curve embedding problem for piecewise linear curves and surfaces in R^2 and R^3, under Hausdorff distance, weak Frechet distance, and Frechet distance as similarity measures for curves. Surprisingly, while several variants of the problem turn out to have polynomial-time solutions, we show that in R^3 the simple curve embedding problem is NP-hard under Frechet distance even if S is a plane, as well as under weak Frechet distance if S is a terrain. Additionally, these results give insight into the difficulty of computing the Frechet distance between surfaces, and they imply that the partial Frechet distance between non-planar surfaces is NP-hard as well.

Includes members:
  Member "untangling a planar graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometry and generation of a new graph planarity game")
  Member "can we compute the similarity between surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing the frechet distance of trees and graphs of bounded tree width")

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)