928 research outputs found
Recommended from our members
A 10-point interpolatory recursive subdivision algorithm for the generation of parametric surfaces
In this paper, an interpolatory subdivision algorithm for surfaces over arbitrary triangulations is introduced and its properties over uniform triangulations studied. The Butterfly Scheme, which is introduced by Dyn, Gregory and Levin is a special case of this algorithm. In our analysis, the matrix approach is employed and the idea of "Cross Difference of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. It is proved that the algorithm produces smooth surfaces provided the shape parameters are kept within an appropriate range
Recommended from our members
An interpolatory subdivision algorithm for surfaces over arbitrary triangulations
In this paper, an interpolatory subdivision algorithm for surfaces over ar-bitrary triangulations is introduced and its convergence properties over nonuni-form triangulations studied. The so called Butterfly Scheme (interpolatory) is a special case of this algorithm. In our analysis of the algorithm over uniform triangulations, a matrix approach is employed and the idea, of "Cross Differ-ence of Directional Divided Difference" analysis is presented. This method is a generalization of the technique used by Dyn, Gregory and Levin etc. to analyse univariate subdivision algorithms. While for nonuniform data, an extraordi-nary point analysis is introduced and the local subdivision matrix analysis is presented. It is proved that the algorithm produces smooth surfaces over ar-bitrary triangular networks provided the shape parameters are kept within an appropriate range
Recursive subdivision algorithms for curve and surface design
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, the author studies recursIve subdivision algorithms for curves and surfaces. Several subdivision algorithms are constructed and investigated. Some graphic examples are also presented.
Inspired by the Chaikin's algorithm and the Catmull-Clark's algorithm, some non-uniform schemes, the non-uniform corner cutting scheme and the recursive subdivision algorithm for non-uniform B-spline curves, are constructed and analysed. The adapted parametrization is introduced to analyse these non-uniform algorithms. In order to solve the surface interpolation problem, the Dyn-Gregory-Levin's 4-point interpolatory scheme is generalized to surfaces and the 10-point interpolatory subdivision scheme for surfaces is formulated. The so-called Butterfly Scheme, which was firstly introduced by Dyn, Gregory Levin in 1988, is just a special case of the scheme. By studying the Cross-Differences of Directional Divided Differences, a matrix approach for analysing uniform subdivision algorithms for surfaces is established and the convergence of the 10-point scheme over both uniform and non-uniform triangular networks is studied. Another algorithm, the subdivision algorithm for uniform bi-quartic B-spline surfaces over arbitrary topology is introduced and investigated. This algorithm is a generalization of Doo-Sabin's and Catmull-Clark's algorithms. It produces uniform Bi-quartic B-spline patches over uniform data. By studying the local subdivision matrix, which is a circulant, the tangent plane and curvature properties of the limit surfaces at the so-called Extraordinary Points are studied in detail.The Chinese Educational Commission and The British Council (SBFSS/1987
Intersection of three-dimensional geometric surfaces
Calculating the line of intersection between two three-dimensional objects and using the information to generate a third object is a key element in a geometry development system. Techniques are presented for the generation of three-dimensional objects, the calculation of a line of intersection between two objects, and the construction of a resultant third object. The objects are closed surfaces consisting of adjacent bicubic parametric patches using Bezier basis functions. The intersection determination involves subdividing the patches that make up the objects until they are approximately planar and then calculating the intersection between planes. The resulting straight-line segments are connected to form the curve of intersection. The polygons in the neighborhood of the intersection are reconstructed and put back into the Bezier representation. A third object can be generated using various combinations of the original two. Several examples are presented. Special cases and problems were encountered, and the method for handling them is discussed. The special cases and problems included intersection of patch edges, gaps between adjacent patches because of unequal subdivision, holes, or islands within patches, and computer round-off error
Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory
subdivision. For arbitrarily spaced, planar input data an efficient non-linear
subdivision algorithm is presented that results in limit curves,
reproduces conic sections and respects the convexity properties of the initial
data. Significant numerical examples illustrate the effectiveness of the
proposed method
Subdivision Surface based One-Piece Representation
Subdivision surfaces are capable of modeling and representing complex shapes of arbi-trary topology. However, methods on how to build the control mesh of a complex surfaceare not studied much. Currently, most meshes of complicated objects come from trian-gulation and simplification of raster scanned data points, like the Stanford 3D ScanningRepository. This approach is costly and leads to very dense meshes.Subdivision surface based one-piece representation means to represent the final objectin a design process with only one subdivision surface, no matter how complicated theobject\u27s topology or shape. Hence the number of parts in the final representation isalways one.In this dissertation we present necessary mathematical theories and geometric algo-rithms to support subdivision surface based one-piece representation. First, an explicitparametrization method is presented for exact evaluation of Catmull-Clark subdivisionsurfaces. Based on it, two approaches are proposed for constructing the one-piece rep-resentation of a given object with arbitrary topology. One approach is to construct theone-piece representation by using the interpolation technique. Interpolation is a naturalway to build models, but the fairness of the interpolating surface is a big concern inprevious methods. With similarity based interpolation technique, we can obtain bet-ter modeling results with less undesired artifacts and undulations. Another approachis through performing Boolean operations. Up to this point, accurate Boolean oper-ations over subdivision surfaces are not approached yet in the literature. We presenta robust and error controllable Boolean operation method which results in a one-piecerepresentation. Because one-piece representations resulting from the above two methodsare usually dense, error controllable simplification of one-piece representations is needed.Two methods are presented for this purpose: adaptive tessellation and multiresolutionanalysis. Both methods can significantly reduce the complexity of a one-piece represen-tation and while having accurate error estimation.A system that performs subdivision surface based one-piece representation was im-plemented and a lot of examples have been tested. All the examples show that our ap-proaches can obtain very good subdivision based one-piece representation results. Eventhough our methods are based on Catmull-Clark subdivision scheme, we believe they canbe adapted to other subdivision schemes as well with small modifications
Enhanced Bezier curve models incorporating local information
The Bezier curve is fundamental to many challenging and practical applications, ranging from computer aided geometric design and postscript font representations through to generic object shape descriptors and surface representation. A drawback of the Bezier curve however, is that it only considers global information about the control points, so there is often a large gap between the curve and its control polygon, leading to considerable error in curve representations. To address this issue, this paper presents enhanced Bezier curve (EBC) models which seamlessly incorporate local information. The performance of the models is empirically evaluated upon a number of natural and synthetic objects having arbitrary shape and both qualitative and quantitative results confirm the superiority of both EBC models in comparison with the classical Bezier curve representation, with no increase in the order of computational complexity
A Framework for Dynamic Terrain with Application in Off-road Ground Vehicle Simulations
The dissertation develops a framework for the visualization of dynamic terrains for use in interactive real-time 3D systems. Terrain visualization techniques may be classified as either static or dynamic. Static terrain solutions simulate rigid surface types exclusively; whereas dynamic solutions can also represent non-rigid surfaces. Systems that employ a static terrain approach lack realism due to their rigid nature. Disregarding the accurate representation of terrain surface interaction is rationalized because of the inherent difficulties associated with providing runtime dynamism. Nonetheless, dynamic terrain systems are a more correct solution because they allow the terrain database to be modified at run-time for the purpose of deforming the surface. Many established techniques in terrain visualization rely on invalid assumptions and weak computational models that hinder the use of dynamic terrain. Moreover, many existing techniques do not exploit the capabilities offered by current computer hardware. In this research, we present a component framework for terrain visualization that is useful in research, entertainment, and simulation systems. In addition, we present a novel method for deforming the terrain that can be used in real-time, interactive systems. The development of a component framework unifies disparate works under a single architecture. The high-level nature of the framework makes it flexible and adaptable for developing a variety of systems, independent of the static or dynamic nature of the solution. Currently, there are only a handful of documented deformation techniques and, in particular, none make explicit use of graphics hardware. The approach developed by this research offloads extra work to the graphics processing unit; in an effort to alleviate the overhead associated with deforming the terrain. Off-road ground vehicle simulation is used as an application domain to demonstrate the practical nature of the framework and the deformation technique. In order to realistically simulate terrain surface interactivity with the vehicle, the solution balances visual fidelity and speed. Accurately depicting terrain surface interactivity in off-road ground vehicle simulations improves visual realism; thereby, increasing the significance and worth of the application. Systems in academia, government, and commercial institutes can make use of the research findings to achieve the real-time display of interactive terrain surfaces
- …