A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
PHIGS programming manual
Adaptive generation of surfaces in volume data
The Visual Computer: International Journal of Computer Graphics
Decreasing Isosurface Complexity via Discrete Fitting
Decreasing Isosurface Complexity via Discrete Fitting
VIS '94 Proceedings of the conference on Visualization '94
| Hi-index | 0.00 |
A technique to triangulate planar convex polygons having T-vertices is described. Simple strip or fan tessellation of a polygon with T-vertices can result in zero-area triangles and compromise the rendering process. Our technique splits such a polygon into one triangle strip and, at most, one triangle fan. The technique is particularly useful in multiresolution or adaptive representation of polygonal surfaces and the simplification of surfaces.