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 "applied similarity problems using frechet distance"):
  Abstract: In the first part of this thesis, we consider an instance of Frechet distance problem in which the speed of traversal along each segment of the curves is restricted to be within a specfied range. This setting is more realistic than the classical Frechet distance setting, specially in GIS applications. We also study this problem in the setting where the polygonal curves are inside a simple polygon. #R##N#In the second part of this thesis, we present a data structure, called the free-space map, that enables us to solve several variants of the Frechet distance problem efficiently. Our data structure encapsulates all the information available in the free-space diagram, yet it is capable of answering more general type of queries efficiently. Given that the free-space map has the same size and construction time as the standard free-space diagram, it can be viewed as a powerful alternative to it. As part of the results in Part II of the thesis, we exploit the free-space map to improve the long-standing bound for computing the partial Frechet distance and obtain improved algorithms for computing the Frechet distance between two closed curves, and the so-called minimum/maximum walk problem. We also improve the map matching algorithm for the case when the map is a directed acyclic graph. #R##N#As the last part of this thesis, given a point set S and a polygonal curve P in R^d, we study the problem of finding a polygonal curve Q through S, which has a minimum Frechet distance to P. Furthermore, if the problem requires that curve Q visits every point in S, we show it is NP-complete.

Includes members:
  Member "four soviets walk the dog with an application to alt s conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fresh fr echet similarity with hashing")
  Member "locally correct frechet matchings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "four soviets walk the dog improved bounds for computing the frechet distance")
  Member "similarity of polygonal curves in the presence of outliers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximating the integral fr echet distance")
  Member "hardness results on curve point set matching with frechet distance":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding a curve in a point set")
  Member "fr echet distance problems in weighted regions":
    also connected through other hyperedges:
      (none)
  Member "can we compute the similarity between surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)