Tessellation (computer graphics)

In computer graphics, tessellation is used to manage datasets of polygons (sometimes called vertex sets) presenting objects in a scene and divide… (More)
Wikipedia

Related topics

Related topics

41 relations
ATI TruFormAdaptive mesh refinementArcheAge 3.00Boundary representation
(More)

Broader (1)

Computer graphics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Dynamic and Adaptive Tessellation of Bézier Surfaces
Bézier surfaces offer powerful mechanisms to describe high quality models in computer graphics. In this paper we present a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Preserving privacy in participatory sensing systems
0140-3664/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.comcom.2009.08.012 q Part of this work has been published at the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
Semi-Uniform Adaptive Patch Tessellation
We present an adaptive tessellation scheme for surfaces consisting of parametric patches. The resulting tessellations are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
Automatic pre-tessellation culling
Graphics processing units supporting tessellation of curved surfaces with displacement mapping exist today. Still, to our… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
AnonySense: Opportunistic and Privacy-Preserving Context Collection
Opportunistic sensing allows applications to “task” mobile devices to measure context in a target region. For example, one could… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The design and evaluation of a generic method for generating mosaicked multispectral filter arrays
The technology of color filter arrays (CFA) has been widely used in the digital camera industry since it provides several… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
1999
1999
Two-dimensional phase unwrapping using a block least-squares method
We present a block least-squares (BLS) method for two-dimensional (2-D) phase unwrapping. The method works by tessellating the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table III
Is this relevant?
Highly Cited
1997
Highly Cited
1997
An improved seeded region growing algorithm
Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1990
1990
Computational geometric methods in volumetric intersection for 3D reconstruction
Generation and analysis of 3D models is an important task that enables automatic inspection, placement, and manipulation of… (More)
Is this relevant?
Highly Cited
1963
Highly Cited
1963
The converse of Moore’s Garden-of-Eden theorem
  • John Myhill
  • 1963
We presuppose the terminology of Moore [l]. In this paper, Moore proves that the existence of two mutually erasable… (More)
Is this relevant?