CGAL users discussion list

[VSav <>]

Hi,

I also tried another way to crop the apollonius graph.

Following is my code : 

typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel_Exact;
typedef CGAL::Apollonius_graph_traits_2<Kernel_Exact>             APT;
typedef CGAL::Apollonius_site_2<Kernel_Exact>                   Site_2_Apo;
typedef Site_2_Apo::Point_2                                    
Site_2_Point_2;
typedef Site_2_Apo::Weight                                     
Site_2_Weight;
typedef CGAL::Apollonius_graph_traits_2<Kernel_Exact>                         
    
AGT2_K;
typedef CGAL::Apollonius_graph_2<AGT2_K>                                      
     
AG2;
typedef CGAL::Apollonius_graph_adaptation_traits_2<AG2>                       
    
AG2_Trait;
typedef CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>       
    
AG2_Policy;
typedef CGAL::Voronoi_diagram_2<AG2,AG2_Trait,AG2_Policy>                     
    
VD_AG2;
typedef VD_AG2::Bounded_faces_iterator  Bounded_faces_iterator;
typedef VD_AG2::Unbounded_faces_iterator  Unbounded_faces_iterator;
typedef VD_AG2::Ccb_halfedge_circulator   Ccb_halfedge_circulator;
typedef VD_AG2::Halfedge_handle           Halfedge_handle;
typedef VD_AG2::Face_handle                          Face_handle;
typedef VD_AG2::Vertex_handle                        Vertex_handle;
typedef VD_AG2::Delaunay_graph::Vertex_handle  Delaunay_vertex_handle;
typedef VD_AG2::Delaunay_graph::Edge Delaunay_edge;
typedef VD_AG2::Unbounded_halfedges_iterator Unbounded_halfedges_iterator;




using namespace std;
int main(){
  std::ifstream ifs("sites.cin");
  assert( ifs );
  VD_AG2 VDA;    

  Site_2_Apo  site;
  while ( ifs >> site )
  {
    VDA.insert(site);
  }
  Face_handle face1;
  float x,y,x1,y1;

for(Unbounded_faces_iterator f = VDA.unbounded_faces_begin(); f !=
VDA.unbounded_faces_end(); f++)
    {

        Ccb_halfedge_circulator ec_start = (f)->ccb();
        Ccb_halfedge_circulator ec = ec_start;
        //cout<<"Helllllo "<<ec->vertex(<<"\n";
        face1 = f;
        Delaunay_vertex_handle vh =  f->dual();
        cout<<"\n\nVERTEX : "<<vh->site()<<"\n";
        
        do {            
        
          Halfedge_handle ec1 = ec;
          if(ec1->has_source()){
            std::cout<<"Source : " << ec->source()->point()<<"\n";
          }
          else{
            cout<<"NOT\n";
          }
          if(ec1->has_target()){
            std::cout<<"target : " << ec->target()->point()<<"\n";
          }
          else{
            *CGAL::Object o = VDA.dual().dual(ec->dual());*
            
            cout<<"NOT\n";
        } 
      }while ( ++ec != ec_start );        
     
    }
  return 0;
} 



The line    *CGAL::Object o = VDA.dual().dual(ec->dual());* gives me
following error 

            CGAL::Object o = VDA.dual().dual(ec->dual());
                                                        ^
In file included from /usr/include/CGAL/Apollonius_graph_2.h:1345:0,
                 from /home/Research/CGAL-5.0.2/B_Box/B_Box.cpp:14:
/usr/include/CGAL/Apollonius_graph_2/Apollonius_graph_2_impl.h:186:1: note:
declared private here
 Apollonius_graph_2<Gt,Agds,LTag>::


what does this error mean. How can we resolve this error.
My entire project is dependent on cropped apollonius graph. I have also
tried draw_dual() method suggested by sebastein, but i am not able to print
the cropped apollonius diagram. I have mentioned my code in previous mail.
If you have an idea please help me.

Thanks,
Virti





--
Sent from: http://cgal-discuss.949826.n4.nabble.com/