摘要:

AbstractThe dual intersection test is described. It is a new method for deciding whether a line intersects a window. The concept of semi‐homogeneous coordinates is introduced. It allows us to define line segments in projective space, and to derive a generalized Cohen‐Sutherland end‐point test for such segments. When this is combined with the dual intersection test, we obtain new clipping algorithms for 2D and 3D projective

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410003

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY

摘要:

AbstractA parallel raster algorithm to draw Gouraud shaded triangles is presented. At the heart of the algorithm is a new constrained parallel edge‐traversal technique. This parallel traversal represents an increased level of parallelism compared to the existing solutions. Next, traditional algorithms take different amounts of time to advance from one horizontal span to another for the left edge and the right edge of the triangle when the slope of one of the edges is more than one and that of the other edge is less than one. This causes one processor to wait for another processor. The parallel constrained edge traversal technique removes this problem by directly jumping from one span to the next. It also ensures that adjacent triangles that share an edge do not share any pixels. Moreover, no cracks occur between adjacent polygons. Unlike some existing algorithms whose complexity depends on the size of the bounding box of the triangle, the complexity of our algorithm is solely dependenton the perimeter and area of the triangle.Due to the above features, the algorithm presented here exposes a greater degree of parallelism at considerably lesser cost and achieves better processor utilization, compared to existing algorithms for this problem1, 2, 3, 4, 5, 6. The algorithm is well suited for hardware implementatio

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410017

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY

摘要:

AbstractThe control of shape of curves is of great importance in computer aided geometric design. Determination of planar curves' convexity, the detection of infection points, coincident regions, and self intersection points, the enclosed area of a closed curve, and the locations of extreme curvature are importantfeatures of curves that can affect the design, in modelling environments.In this paper, we investigate the ability to robustly answer the above queries and related questions using an approach which exploits both symbolic computation and numeric analysis.

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410025

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY

摘要:

AbstractTransformations based on radial basis junctions have proven to be a powerful tool in image warping. In the present work we decompose these transformations into linear and radial terms, and show examples where such a decomposition is advantageous. Locally supported basis functions are introduced. Several applications are demonstrated, and a comparison with other warping techniques is carried out. Finally, some fine points of image warping are discussed.

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410035

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY

摘要:

AbstractThe main preoccupations of research in computer‐aided geometric design have been on shape‐specification techniques for polynomial curves and surfaces, and on the continuity between segments or patches. When modelling with such techniques, curves and surfaces can be compressed or expanded arbitrarily. There has been relatively little work on interacting with direct spatial properties of curves and surfaces, such as their arc length or surface area. As a first step, we derive families of parametric piecewise polynomial curves that satisfy various positional and tangential constraints together with arc‐length constraints. We call these curvesisometric curves. A space curve is defined as a sequence of polynomial curve segments, each of which is defined by the familiar Hermite or Bézier constraints for cubic polynomials; as well, each segment is constrained to have a specified arc length. We demonstrate that this class of curves is attractive and stable. We also describe the numerical techniques used that are sufficient for achieving real time interaction with these curves on low‐end work

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410047

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY

摘要:

AbstractA new algorithm is presented for viewing three‐dimensional objects, represented by an octree, from an arbitrary location. The algorithm generates aperspective view of the objects while eliminating hidden surfaces. The viewer can be located anywhere inside or outside the objects. The algorithm presented in this short notefixes an artifact that is generated by a previously published algorithm due to Meagher when the viewer is located in certain regions in space. The new algorithm traverses the octree in a back‐to‐front order and recursively chooses correct orders for visiting the sons of non‐lea

ISSN:0167-7055    

DOI:10.1111/1467-8659.1410059

出版商:Blackwell Science Ltd    

年代:1995

数据来源: WILEY