33 	B.begin_surface( m_polyhedron->m_Vertices.size(), m_polyhedron->m_Faces.size());  in operator ()()
36 	for (size_t n=0;n<m_polyhedron->m_Vertices.size();++n)  in operator ()()
37 …_vertex( Point( m_polyhedron->m_Vertices.at(n).coord[0], m_polyhedron->m_Vertices.at(n).coord[1], …  in operator ()()
100 	for (size_t n=0;n<primPolyhedron->m_Vertices.size();++n)  in CSPrimPolyhedron()
101 		AddVertex(primPolyhedron->m_Vertices.at(n).coord);  in CSPrimPolyhedron()
123 	m_Vertices.clear();  in Reset()
139 	m_Vertices.push_back(nv);  in AddVertex()
144 	if (n<m_Vertices.size())  in GetVertex()
145 		return m_Vertices.at(n).coord;  in GetVertex()
226 	if (m_Vertices.size()==0)  in GetBoundBox()
229 	dBoundBox[0]=dBoundBox[1]=m_Vertices.at(0).coord[0];  in GetBoundBox()
230 	dBoundBox[2]=dBoundBox[3]=m_Vertices.at(0).coord[1];  in GetBoundBox()
231 	dBoundBox[4]=dBoundBox[5]=m_Vertices.at(0).coord[2];  in GetBoundBox()
233 	for (size_t n=0;n<m_Vertices.size();++n)  in GetBoundBox()
235 		dBoundBox[0]=std::min(dBoundBox[0],(double)m_Vertices.at(n).coord[0]);  in GetBoundBox()
236 		dBoundBox[2]=std::min(dBoundBox[2],(double)m_Vertices.at(n).coord[1]);  in GetBoundBox()
237 		dBoundBox[4]=std::min(dBoundBox[4],(double)m_Vertices.at(n).coord[2]);  in GetBoundBox()
238 		dBoundBox[1]=std::max(dBoundBox[1],(double)m_Vertices.at(n).coord[0]);  in GetBoundBox()
239 		dBoundBox[3]=std::max(dBoundBox[3],(double)m_Vertices.at(n).coord[1]);  in GetBoundBox()
240 		dBoundBox[5]=std::max(dBoundBox[5],(double)m_Vertices.at(n).coord[2]);  in GetBoundBox()
283 	for (size_t n=0;n<m_Vertices.size();++n)  in Write2XML()
286 		TiXmlText text(CombineArray2String(m_Vertices.at(n).coord,3,','));  in Write2XML()
356 	stream << " Number of Vertices: " << m_Vertices.size() << std::endl;  in ShowPrimitiveStatus()