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: "orientation constrained rectangular layouts"
  Abstract: We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.

Connected through hyperedge HE-1 (induced by source paper "adjacency preserving spatial treemaps"):
  with members:
    - "area universal rectangular layouts"
    - "minimum weight triangulation is np hard"

Connected through hyperedge HE-2 (induced by source paper "steinitz theorems for simple orthogonal polyhedra"):
  with members:
    - "adjacency preserving spatial treemaps"
    - "the complexity of bendless three dimensional orthogonal graph drawing"
    - "area universal rectangular layouts"
    - "isometric diamond subgraphs"
    - "the lattice dimension of a graph"
    - "nonorthogonal polyhedra built from rectangles"

Connected through hyperedge HE-3 (induced by source paper "regular labelings and geometric structures"):
  with members:
    - "steinitz theorems for simple orthogonal polyhedra"
    - "area universal rectangular layouts"
    - "compact floor planning via orderly spanning trees"

Connected through hyperedge HE-4 (induced by source paper "graph theoretic solutions to computational geometry problems"):
  with members:
    - "optimal angular resolution for face symmetric drawings"
    - "area universal rectangular layouts"
    - "testing bipartiteness of geometric intersection graphs"
    - "optimal embedding into star metrics"
    - "trees with convex faces and optimal angles"
    - "algorithms for drawing media"
    - "the traveling salesman problem for cubic graphs"

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)