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: "computing shortest paths among curved obstacles in the plane"
  Abstract: A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well studied. In this paper, we consider the problem version on curved obstacles, commonly modeled as splinegons. A splinegon can be viewed as replacing each edge of a polygon by a convex curved edge (polygons are special splinegons). Each curved edge is assumed to be of O(1) complexity. Given in the plane two points s and t and a set of $h$ pairwise disjoint splinegons with a total of $n$ vertices, we compute a shortest s-to-t path avoiding the splinegons, in $O(n+h\log^{1+\epsilon}h+k)$ time, where k is a parameter sensitive to the structures of the input splinegons and is upper-bounded by $O(h^2)$. In particular, when all splinegons are convex, $k$ is proportional to the number of common tangents in the free space (called "free common tangents") among the splinegons. We develop techniques for solving the problem on the general (non-convex) splinegon domain, which also improve several previous results. In particular, our techniques produce an optimal output-sensitive algorithm for a basic visibility problem of computing all free common tangents among $h$ pairwise disjoint convex splinegons with a total of $n$ vertices. Our algorithm runs in $O(n+h\log h+k)$ time and $O(n)$ space, where $k$ is the number of all free common tangents. Even for the special case where all splinegons are convex polygons, the previously best algorithm for this visibility problem takes $O(n+h^2\log n)$ time.

Connected through hyperedge HE-1 (induced by source paper "an efficient algorithm for computing high quality paths amid polygonal obstacles"):
  with members:
    - "adaptive metrics for adaptive samples"
    - "approximating nearest neighbor distances"

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

Connected through hyperedge HE-3 (induced by source paper "visibility graphs dismantlability and the cops and robbers game"):
  with members:
    - "unsolved problems in visibility graphs of points segments and polygons"

Connected through hyperedge HE-4 (induced by source paper "approximate euclidean shortest paths in polygonal domains"):
  with members:
    - "linear space approximate distance oracles for planar bounded genus and minor free graphs"
    - "a near optimal algorithm for finding euclidean shortest path in polygonal domain"

Connected through hyperedge HE-5 (induced by source paper "two point l_1 shortest path queries in the plane"):
  with members:
    - "computing l1 shortest paths among polygonal obstacles in the plane"
    - "a near optimal algorithm for finding euclidean shortest path in polygonal domain"
    - "querying two boundary points for shortest paths in a polygonal domain"

Connected through hyperedge HE-6 (induced by source paper "computing l1 shortest paths among polygonal obstacles in the plane"):
  with members:
    - "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)