Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,530,366 papers from all fields of science
Search
Sign In
Create Free Account
Triangle fan
Known as:
Fan
A triangle fan is a primitive in 3D computer graphics that saves on storage and processing time. It describes a set of connected triangles that share…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Computer graphics
Graphics pipeline
Polygon mesh
Triangle mesh
Triangle strip
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
ARINC661 Graphics Rendering Based on OpenVG and Its Use Cases with Wireless Communications
Jiyoung Yoon
,
Nakhoon Baek
,
Hwanyong Lee
Wireless personal communications
2015
Corpus ID: 34206417
ARINC 661 is a standard for the CDS (Cockpit Display Systems) defined by ARINC (Aeronautical Radio, Inc.) and used for…
Expand
2011
2011
Compression progressive et tatouage conjoint de maillages surfaciques avec attributs de couleur. (Progressive compression and joint compression and watermarking of surface mesh with color attributes)
Ho Lee
2011
Corpus ID: 29102808
L’utilisation des modeles 3D, representes sous forme de maillage, est sans cesse croissante dans de nombreuses applications. Pour…
Expand
2009
2009
A Triangle-Fan-based approach for low complexity 3D mesh compression
K. Mamou
,
T. Zaharia
,
F. Prêteux
International Conference on Information Photonics
2009
Corpus ID: 8359535
This paper proposes a novel approach for mono-resolution 3D mesh compression, called TFAN (Triangle Fan-based compression). TFAN…
Expand
2007
2007
Uncoupled parallel view dependant level of detail rendering of bintree triangulations
B. Biedermann
,
M. Rivara
International Conference on Computer Graphics…
2007
Corpus ID: 35894295
A skating shoe including a rigid structural member embedded within the sole of the shoe which permits the selective mounting of…
Expand
2004
2004
Fast Ray-Triangle Fan Intersection
Eric Galin
2004
Corpus ID: 36699
This paper presents an algorithm for computing the nearest intersection between a ray a fan of triangles. Our approach speeds up…
Expand
2002
2002
Advancing Fan-Front: An Efficient Connectivity Compression Technique for Large 3D Triangle Meshes
S. Mudur
,
S. Babji
,
Dinesh Shikhare
Indian Conference on Computer Vision, Graphics…
2002
Corpus ID: 8452352
In this paper we present a new algorithm for compressing large 3D triangle meshes through the successive conquest of triangle…
Expand
2002
2002
3D mesh compression using triangle fan structure
Jae-Young Sim
,
Chang-Su Kim
,
Sang Uk Lee
IEEE International Symposium on Circuits and…
2002
Corpus ID: 60463846
In this paper, we propose an efficient compression algorithm for 3D triangular mesh, which is composed of connectivity data and…
Expand
2000
2000
Multiresolution Modelling of Polygonal Surface Meshes Using Triangle Fans
José Ribelles
,
Angeles López
,
I. Remolar
,
O. Belmonte
,
M. Chover
Discrete Geometry for Computer Imagery
2000
Corpus ID: 17654903
Multiresolution modellingof polygonal surface meshes has been presented as a solution for the interactive visualisation of scenes…
Expand
1999
1999
CellFast: Interactive Unstructured Volume Rendering
C. Wittenbrink
1999
Corpus ID: 15195976
Shirley and Tuchman’s projected tetrahedra approach is a fast algorithm for unstructured volume visualization, because it…
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
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