CGAL users discussion list

["Antonino Mistretta" <>]

Dear CGAL user,

I've obtained skeleton vertex, in follow manner:

        // forall vertex in straight_skeleton
        for(Base::Vertex_iterator it = (*skeleton).vertices_begin (); it !=
(*skeleton).vertices_end (); ++ it)
        {       
                //is a skeleton point??
                if ( it->is_skeleton() )        
                {
                        outX.push_back(it->point().x());
                        outY.push_back(it->point().y());
                }
        }


I've another questions:
-  How can I improve performance?
-  How can I obtain fewer skeleton point?

In attachment you find a example polygon skeleton?

Thanks
AM

2008/4/4, Antonino Mistretta 
<>:
> >  A function called is_bisector()  sounds and is a function
>  >  returning a boolean value, not a vertex.
>
>
> yes, but it returns true if it point to a vertex that is a skeleton
>  vertex(manual):
>
>  bool      h.is_bisector ()       Returns true iff this is a bisector (or
>  skeleton) halfedge (i.e. is not a contour halfedge).
>


-- 
AM

Attachment: tmp.JPG
Description: JPEG image