Painter's algorithm

Known as: Painters algorithm, Reverse painter's algorithm, Priority fill 
The painter's algorithm, also known as a priority fill, is one of the simplest solutions to the visibility problem in 3D computer graphics. When… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2014
012319952014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
saw the light” figure often in our everyday speech, we do not typically contemplate light. We may marvel at its seemingly… (More)
Is this relevant?
2014
2014
We produce painterly images of 3D models by covering them in a particle system of brush strokes. Strokes move along with the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2012
2012
Today, detailed, complete and exact 3D models with photo-realistic textures are increasingly demanded for numerous applications… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Paintings are typically considered as more or less flat objects with color as the most relevant information. Therefore, they are… (More)
  • figure 2
  • figure 1
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2009
2009
Painter algorithm is an approach by which computer realizes image blanking in light of the sequence of graphics in depth… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table I
Is this relevant?
2009
2009
ion such as a widget set including buttons, menus, and other basic GUI elements. Performing the transformation of each client’s… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
2008
2008
Martin Kemp The French Impressionist painters referred to the book Modern Chromatics: With Applications to Art and Industry as… (More)
Is this relevant?
2003
2003
A new algorithm based on the sweep plane approach to determine the machined part geometry in 5-axis machining with general APT… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2000
2000
The octree is a common data structure used to model 3-dimensional data. The linear octree is a compact representation of an… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
1997
1997
McMillan and Bishop’s 3D image warp can be efficiently implemented by exploiting the coherency of its memory accesses. We analyze… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?