Quadratic Bezier triangles as drawing primitives

@article{Bruijns1998QuadraticBT,
  title={Quadratic Bezier triangles as drawing primitives},
  author={Jan Bruijns},
  journal={Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware},
  year={1998}
}
  • J. Bruijns
  • Published 1 August 1998
  • Computer Science
  • Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Bezier Triangles As Drawing Primitives J. Bruijns, Philips Research Laboratories’ We propose to use quadratic Bezier triangles as additional drawing primitives: quadratic Bezier triangles require much less model data for faithful representation of curved surfaces than planar triangles. Therefore, they require less storage and/or transmission capacity. Furthermore, they allow automatic level-of-detail. Finally, they result in considerable savings in model-view transformations and lighting… 

High-Quality Rendering of Quartic Spline Surfaces on the GPU

A novel GPU-based algorithm for high-quality rendering of bivariate spline surfaces that uses quartic smooth splines on triangulations rather than triangular meshes for Phong illumination on the GPU is presented.

Shading By Fast Bi-Quadratic Normal Vector Interpolation

It is shown that Bezier triangles and curves can be used for reducing the cost of Biquadratic Phong shading by virtue of fast calculation of area coordinates at the edge points, and this shading algorithm becomes faster than all the known fast Bi-quadratic normal vector interpolation methods.

A new model for 3D graphical rendering

A non linear model for geometrical structures in a 3D rendering engine is considered (the Lembo model) and the properties of the model are shown; an ecient algorithm is shown to solve the projection problem directly on the model equations.

A new model for 3 D graphical rendering

A non linear model (the Lembo model) for geometrical structures in a 3D rendering engine is considered: firstly the properties of the model are shown; then an efficient algorithm is shown to solve the projection problem directly on the model equations.

An Efficient Algorithm for Adaptive Segmentation and Tessellation with Pixel Precision

A new algorithm is proposed to get a representation of a curved surface with the precision of the image pixel, with principles common to every kind of surface, and how these principles can be applied to quadratic and cubic beziér triangles.

Hardware implementation of the subdivision loop algorithm

A comparative analysis of two possible implementations of this hardware unit corresponding to two different alternatives for applying loop subdivision to triangle meshes: subdivision based on forward differencing and on meshing scheme.

Virtual worlds modeling for Web deployment

  • G. MoschovitisK. KarpouzisS. Kollias
  • Computer Science
    2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)
  • 2000
A design architecture for the graphics engine of a virtual reality system to be deployed over the Web and a prototype application for virtual worlds modeling is presented along with detailed discussion on technical and implementation issues.

New models for high-quality surface reconstruction and rendering

  • T. Kalbe
  • Computer Science, Mathematics
  • 2011
The main contribution of this thesis is the development of the first efficient GPU-based reconstruction and visualization methods using trivariate splines, i.e., splines defined on tetrahedral partitions, which are very well-suited for real-time reconstruction and high-quality visualizations of surfaces from volume data.

Adaptive quasi-interpolating quartic splines

An adaptive quasi-interpolating quartic spline construction for regularly sampled surface data based on a uniform quasi-Interpolating scheme, employing quartic triangular patches with C1-continuity and optimal approximation order.

Watertight tessellation using forward differencing

An algorithm and hardware for the tessellation of polynomial surfaces that produces a bit-for-bit consistent triangle mesh across multiple independently tessellingated patches with continuous level-of-detail is described.

References

SHOWING 1-10 OF 20 REFERENCES

Interactive Display of Large NURBS Models

These algorithms work well in practice and, on high-end graphics systems, are able to display models described using thousands of Bezier surfaces at interactive frame rates.

Curves and surfaces for computer-aided geometric design - a practical guide, 4th Edition

  • G. Farin
  • Computer Science
    Computer science and scientific computing
  • 1997
The fourth edition has been thoroughly updated and revised to include a new chapter on recursive subdivision, as well as new sections on triangulations and scattered data interpolants, and the disk in the back of the book has been updated to include all of the programs, as the data sets from the text.

A scan line algorithm for computer display of curved surfaces

The method described here extends polygon based techniques to produce an excellent approximation of bi-cubic parametric surfaces in scan line order to produce shaded images of curved surfaces.

Real-time rendering of trimmed surfaces

Rational tensor product surfaces, (Bézier, NURBS, Hermite, polynomial, etc.) are rendered in real-time by uniform faceting and can be balanced for optimal implementation on different hardware platforms.

Fast Dynamic Tessellation of Trimmed NURBS Surfaced 1

This paper presents a technique that uses graphical compilation to enable fast dynamic tessellation of trimmed NURBS surfaces under highly varying transforms.

Shading bicubic patches

Two new methods are presented for deriving bicUBic approximations to the shading parameters over a bicubic patch, suitable for both hardware and software implementations.

Adaptive forward differencing for rendering curves and surfaces

An adaptive forward differencing algorithm is presented for rapid rendering of cubic curves and bicubic surfaces and involves a simple linear transformation on the coefficients of the curve which can be accomplished with shifts and adds.

An adaptive subdivision algorithm for crack prevention in the display of parametric surfaces

An algorithm is presented for rendering parametric spline patches using adaptive subdivision to allow large approximating polygons whenever their use does not result in visible errors in patch boundanes or 10 lighting anomalies.

Rendering cubic curves and surfaces with integer adaptive forward differencing

An error analysis of forward differencing is provided which is useful as a guide for integer AFD implementation, and the proposed technique using 32 bit integer values is capable of rendering curves having more than 4K forward steps with an accumulated error of less than one pixel and no overflow problems.