space_search_test.cpp

#include <fstream>

#include "CME212/SDLViewer.hpp"
#include "CME212/Util.hpp"
#include "CME212/Color.hpp"
#include "CME212/Point.hpp"

#include "Graph.hpp"
#include "SpaceSearcher.hpp"

int main()
{
  // Construct an empty graph
  using GraphType = Graph<int,int>;
  using Node = typename GraphType::node_type;
  GraphType graph;

  // Create a nodes_file from the first input argument
  std::ifstream nodes_file("data/large.nodes");
  // Interpret each line of the nodes_file as a 3D Point and add to the Graph
  Point p;
  std::vector<typename GraphType::node_type> nodes;
  while (CME212::getline_parsed(nodes_file, p))
    nodes.push_back(graph.add_node(p));

  // Create a tets_file from the second input argument
  std::ifstream tets_file("data/large.tets");
  // Interpret each line of the tets_file as four ints which refer to nodes
  std::array<int,4> t;
  while (CME212::getline_parsed(tets_file, t))
    for (unsigned i = 1; i < t.size(); ++i)
      for (unsigned j = 0; j < i; ++j)
        graph.add_edge(nodes[t[i]], nodes[t[j]]);

  std::cout << graph.num_nodes() << "  " << graph.num_edges() << std::endl;

  Box3D bigbb(Point(-2,-2,-2), Point(2,2,2));
  auto n2p = [](const Node& n) { return n.position(); };

  // Construct the Searcher
  CME212::Clock clock;
  SpaceSearcher<Node> searcher(bigbb, graph.node_begin(), graph.node_end(), n2p);
  double time = clock.seconds();
  std::cout << "Time: " << time << std::endl;

  // Launch a viewer
  CME212::SDLViewer viewer;
  viewer.launch();
  auto node_map = viewer.empty_node_map(graph);

  // Plot a portion of the skull
  Box3D bb(Point(-0.5,-0.5,-0.5), Point(0.5,-0.25,0.3));
  viewer.add_nodes(searcher.begin(bb), searcher.end(bb), node_map);
  //viewer.add_nodes(graph.node_begin(), graph.node_end(), node_map);
  //viewer.add_edges(graph.edge_begin(), graph.edge_end(), node_map);

  // Create another graph to plot the bounding box (hypergraph bounding box)
  GraphType bb_graph;
  auto hypr = [&](int a, int b) { return a&(1<<b) ? bb.min()[b] : bb.max()[b]; };
  for (int a = 0; a < 8; ++a) {
    bb_graph.add_node(Point(hypr(a,0), hypr(a,1), hypr(a,2)));
    for (int b = 0; b < a; ++b) {
      int c = b^a; c &= c-1; c &= c-1;
      if (c == 0)    // Hamming dist == 2
        bb_graph.add_edge(bb_graph.node(a), bb_graph.node(b));
    }
  }

  viewer.add_nodes(bb_graph.node_begin(), bb_graph.node_end(), node_map);
  viewer.add_edges(bb_graph.edge_begin(), bb_graph.edge_end(), node_map);

  viewer.center_view();
}