TL;DR: This paper shows that by allowing (if necessary) two cubic pieces in some data intervals rather than one, convexity can always be preserved.

TL;DR: This article considers the generalized transformation function z ← z α + c for generating fractal images and the value of α, found that when α is a positive integer number, the resulting image contains lobular structures.

TL;DR: Interval methods provide a degree of robustness to the algorithms which is difficult to achieve when point sampling alone is used to detect the contours and surfaces.

TL;DR: In this paper, a general solution for shading surfaces illuminated by a linear light source is proposed, and a formulation allowing for faster computation of the diffuse component of light reflection is derived.

TL;DR: A new hybrid pseudo-CSG/BRep schema for product modelling is described that intends to capture the virtues of both representation schemas and eliminate as much as possible as their underlying drawbacks.

TL;DR: A new approach to determine the optical impression of objects on the landscape combining the standard methods of computer graphics, image analysis, physiological aspects of the human visual system, and physical conditions of the environment using the example of overhead lines is described.

TL;DR: This article presents a particularly efficient navigation algorithm employing two decision vectors maintained by incremental integer arithmetic known as a Spatial Measure for Accelerated Ray Tracing (SMART).

TL;DR: A new technique and a package for rapid reconstruction of smooth surfaces from scattered data points based on a fast recurrent algorithm for the Delauney triangulation followed by rational interpolation inside triangles that enables a user to construct a surface of any class of smoothness and degree of convergence.

TL;DR: In this article, the authors describe some of the problems that the design of computerized 2D animation systems raises when such systems are intended to serve professional cartoonists and highlight the special needs of the cartoonist and discuss the hardware and software requirements of systems that can effectively assist him in his work.

TL;DR: This new method very efficiently avoids texture aliasing artifacts by using an accurate convolution obtained naturally from forward mapping, and antialiasing of the final image contours is directly produced by this method.

TL;DR: Pickover's representation of Halley's method applied to solving the polynomial equation z∗∗7 = 1 elicits several remarkable features, including distinguished director nodules that direct the forward orbits out of the chaotic separators to their target basins.

TL;DR: Two versions of the evolution of the Gingerbread Man for the iteration z → z x + c are presented; a previously published version shows an asymmetric evolution as positive real x increases, while a new version shows a symmetric evolution, and several interesting features.

TL;DR: The surface/surface intersection problem as it arises in CAGD is reviewed and algorithms are presented and classified according to the representation of the surfaces.

TL;DR: In this paper, a model based on a partition of the image into elementary regions and the representation of 2D objects by a set of contours is presented, where the insertion of a new contour in a previously defined contour set is defined.

TL;DR: The presented algorithm can accurately construct the Junction lines ( J-lines) formed when objects penetrate each other, which allows the user to define an object as a line, a plane, a convex, or a concave polyhedron, which can include inner edges on any facet of an object.

TL;DR: Julia sets of switched processes are introduced and are of importance in the study of dynamical systems in which several free-standing processes may be involved.

TL;DR: The main emphasis in this paper is put on accelerating volume rendering techniques that are suitable to be carried out on midpriced workstations that are of greater availability in hospitals or research labs in Europe than superworkstations.

TL;DR: The new method introduces dithering patterns as ordered dither does; however, it provides a smoothing parameter p between 0 and 1.5 that can capture very sharp details of images.

TL;DR: The “epsilon cross” and “star trails” methods described here monitor the trajectory of a point, as calculated by the Mandelbrot Set algorithm, on a complex plane.

TL;DR: The system described can trace out the boundary of the input font, find out control points and their corresponding curvatures, and edit (including zooming) the font, based on the least square error curve fitting.

TL;DR: Properties of virtual edges and viewing faces from various 3D curved surfaces are illustrated and a boundary traversal method takes advantage of the data representation and is applied for generating visible-line-only display of the objects.

TL;DR: The merge and box algorithm is presented, which produces images of comparable quality to current graphics methods, and has been parallelized using a single instruction stream, multiple data stream (SIMD) parallel processor.

TL;DR: An algorithm for extracting an intermediate coordinate system from a homogeneous viewing transformation that relates WC to DC is proposed, which exhibits unique features for lighting calculations and for clipping in homogeneous coordinates.

TL;DR: This line algorithm is not related to Euclid's algorithm but instead is based on a fractal definition for the line that has the same dimension as the topological dimension of the line.

TL;DR: In this paper, an algorithm for constructing shadow volumes for CSG objects is presented for a scan-line display algorithm for objects with polygonal primitives, where the shadow of the complete CSG object is the union of these shadow trees.

TL;DR: The role of analyticity, critical points, chaotic forcing, and bistability are discussed as some of the elements needed to answer the major, still unresolved question of whether nature is fractal because, or in spite of, the existence of differentiable systems.

TL;DR: A system for the manipulation of text, image, and graphics items is presented and it is shown that most of these systems are unable to manipulate them in a unified document.

TL;DR: A linear pivoting procedure allowing for exceptionally fast testing of ray intersection with convex polyhedra is presented, and comparisons of this procedure with other methods are given.

TL;DR: This paper largely reflects the ANSI point of view but addresses several aspects from the early ISO work.