Issue 5

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/70

Inverse Displacement Mapping in the General Case

[meta data] [files: ]
Logie, J. R.
; 
Patterson, J. W.

Bresenham's Line Generation Algorithm with Built-in Clipping

[meta data] [files: ]
Kuzmin, Yevgeny P.

Domain Extension of Isothetic Polyhedra with Minimal CSG Representation

[meta data] [files: ]
Arinyo, Robert Juan

BibTeX (Issue 5)
                
@article{
10.1111:1467-8659.1450261,

journal = {Computer Graphics Forum},
title = {{
Inverse Displacement Mapping in the General Case}},

author = {
Logie, J. R.
 and 
Patterson, J. W.
},
year = {
1995},

publisher = {
Blackwell Science Ltd and the Eurographics Association},


ISSN = {1467-8659},

DOI = {
10.1111/1467-8659.1450261}

}
                
@article{
10.1111:1467-8659.1450275,

journal = {Computer Graphics Forum},
title = {{
Bresenham's Line Generation Algorithm with Built-in Clipping}},

author = {
Kuzmin, Yevgeny P.
},
year = {
1995},

publisher = {
Blackwell Science Ltd and the Eurographics Association},


ISSN = {1467-8659},

DOI = {
10.1111/1467-8659.1450275}

}
                
@article{
10.1111:1467-8659.1450281,

journal = {Computer Graphics Forum},
title = {{
Domain Extension of Isothetic Polyhedra with Minimal CSG Representation}},

author = {
Arinyo, Robert Juan
},
year = {
1995},

publisher = {
Blackwell Science Ltd and the Eurographics Association},


ISSN = {1467-8659},

DOI = {
10.1111/1467-8659.1450281}

}

Browse

Recent Submissions

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Inverse Displacement Mapping in the General Case
    (Blackwell Science Ltd and the Eurographics Association, 1995) Logie, J. R.; Patterson, J. W.
    Inverse Displacement Mapping is a form of displacement mapping which allows the ray tracing of displacement mapped surfaces. The technique performs all calculations in the inverse (parametric) space of the surface thus avoiding the need to explicitly model the complex three dimensional geometry. This produces a compact and general algorithm, Only when the solution, in parametric space, has been determined is it transformed back to 3D space. The algorithm works by projecting the ray into the parametric space of the surface. This ray is then split into a series of segments, each of which can be efficiently handled to calculate the intersection points. The algorithm presented here has been used to ray trace displacement mapped objects from a variety of underlying surface types.
  • No Thumbnail Available
    Item
    Bresenham's Line Generation Algorithm with Built-in Clipping
    (Blackwell Science Ltd and the Eurographics Association, 1995) Kuzmin, Yevgeny P.
    One of the most important operations in many graphical systems is the generation of a line segment. This process consists of two stages: clipping and drawing. These two stages are separated in current graphical applications. In this paper a new approach to line generation is proposed, which unifies these stages. The proposed algorithm is based on Bresenham s line generation algorithm to include necessary line clipping. The line clipping stage is an operation-reduced, integer arithmetic only algorithm. The notion of correctness of line clipping is introduced and correctness of the proposed algorithm is shown. Complete C-notation of the algorithm is included.
  • No Thumbnail Available
    Item
    Domain Extension of Isothetic Polyhedra with Minimal CSG Representation
    (Blackwell Science Ltd and the Eurographics Association, 1995) Arinyo, Robert Juan
    We consider the problem of converting boundary representations of isothetic polyhedra into constructive solid geometry (CSG) representations. The CSG representation is a boolean formula based on the half-spaces supporting the faces of the polyhedron. This boolean formula exhibits two important features: no term is complemented (it is monotone) and each supporting half-space appears in the formula once and only once. It is known that such formulas do not always exist for general polyhedra in the three-dimensional space. In this work first we give a procedure that extends the domain of polyhedra for which such a nice representation can be computed. Then we prove that not all cyclic isothetic polyhedra have a CSG representation of the style given above.