Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,167,172 papers from all fields of science
Search
Sign In
Create Free Account
T-vertices
T-vertices is a term used in computer graphics to describe a problem that can occur during mesh refinement or mesh simplification. The most common…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Computer graphics
Digital artifact
Gouraud shading
Level of detail
Subdivision surface
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Matching patterns in networks with multi-dimensional attributes: a machine learning approach
K. Pelechrinis
Social Network Analysis and Mining
2014
Corpus ID: 256097494
Assortative matching is a network phenomenon that arises when nodes exhibit a bias towards connections to others of similar…
Expand
2007
2007
Surface-based deformation for disconnected mesh models
Kenta Ogawa
,
H. Masuda
International Conference on Computer Graphics and…
2007
Corpus ID: 34443043
Surface-based deformation [Sorkine 2005] plays an important role to reuse existing mesh models. This technique encodes geometric…
Expand
2004
2004
Polygonübergreifende Verankerung zur Lichtsimulation
Wolfram Kresse
2004
Corpus ID: 194305124
Ein wichtiger Schritt im Radiosity-Verfahren ist die Beseitigung von visuellen Artefakten. Dabei konnen so genannte T-Vertices…
Expand
2002
2002
A Large Class of Random Tessellations with the Classic Poisson Polygon Distributions
R. E. Miles
,
M. Mackisack
2002
Corpus ID: 28787355
One special case of Arak, Clifford and Surgailis’ 1993 point-based polygon models for random graphs yields an isotropic random…
Expand
1999
1999
Triangulated Neighbourhoods in C4-Free Berge Graphs
Igor Parfenoff
,
F. Roussel
,
I. Rusu
International Workshop on Graph-Theoretic…
1999
Corpus ID: 33694661
We call a T-vertex of a graph G = (V, E) a vertex z whose neighbourhood N(z) in G induces a triangulated graph, and we show that…
Expand
1996
1996
Triangulating Convex Polygons Having T-Vertices
Paolo Cignoni
,
C. Montani
,
Roberto Scopigno
J. Graphics, GPU, & Game Tools
1996
Corpus ID: 205752173
A technique to triangulate planar convex polygons having T-vertices is described. Simple strip or fan tessellation of a polygon…
Expand
1996
1996
Efficient Rendering of Radiosity using Textures and Bicubic Reconstruction
R. Bastos
1996
Corpus ID: 18159643
We present a method to speed up walkthroughs of static scenes. It involves the creation of a continuousC1 radiosity…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE