Method and system for reducing a polygon bounding box
作者： Steven James Heinrich , David Charles Patrick , Walter R. Steiner , Dale L. Kirkland , Eric Lum
DOI:
关键词: Polygon covering 、 Combinatorics 、 Minimum bounding box 、 Star-shaped polygon 、 Minimum bounding box algorithms 、 Mathematics 、 Polygon 、 Midpoint polygon 、 Simple polygon 、 Rectilinear polygon
摘要: In a graphics processing pipeline, unit establishes bounding box around polygon in order to identify sample points that are covered by the polygon. For given point included within box, constructs set of lines intersect at point, where each line is parallel least one side When all vertices reside on lines, may reduce size exclude point.
lens.org 参考文章(93)
Douglas Sim Dietrich, Matthias M. Wloka, Culling in a vertex processing unit ,(2005)
Craig M. Wittenbrink, Vimal S. Parikh, Douglas A. Voorhies, Henry Packard Moreton, John S. Montrym, Clipping with addition of vertices to existing primitives ,(2004)
Bai Xianghui, Yasushi Sugama, Tan Zhiming, Method and apparatus for triangle traversal process in graphic rasterization ,(2009)
Jeffrey Alan Bolz, Tyson Bergland, Alexander Lev Minkin, Patrick R. Brown, System, method, and computer program product for redistributing a multi-sample processing workload between threads ,(2013)
Robert L. Cook, Loren Carpenter, Adaptive depth of field sampling ,(2009)
Gary Look, Prashant Singh, Automated bounding box generation within the boundaries of arbitrary shapes ,(2011)
Simon Fenney, Piers Barber, Rendering in computer graphics systems ,(2014)
David L. Dignam, Sanjay O. Gupta, Oana Baltaretu, Method for determining tiles in a computer display that are covered by a graphics primitive ,(1999)
Michael F. Deering, Graphics system configured to determine triangle orientation by octant identification and slope comparison ,(2000)
John William Howson, Multi-core geometry processing in a tile based rendering system ,(2008)