计算机图形学computer graph.pptVIP

  • 4
  • 0
  • 约1.41万字
  • 约 10页
  • 2022-09-18 发布于四川
  • 举报
* Polygon Scan Conversion Scan Conversion = Fill How to tell inside from outside Convex easy Nonsimple difficult Odd even test Count edge crossings Winding number odd-even fill * Winding Number Count clockwise encirclements of point Alternate definition of inside: inside if winding number ? 0 winding number = 2 winding number = 1 OpenGL Concave Polygon OpenGL can only fill convex polygon correctly * OpenGL Concave Polygon // create tessellator GLUtesselator *tess = gluNewTess(); // describe non-convex polygon gluTessBeginPolygon(tess, user_data); // first contour gluTessBegin

文档评论(0)

1亿VIP精品文档

相关文档