3,849 research outputs found
Feature Adaptive Ray Tracing of Subdivision Surfaces
abstract: Subdivision surfaces have gained more and more traction since it became the standard surface representation in the movie industry for many years. And Catmull-Clark subdivision scheme is the most popular one for handling polygonal meshes. After its introduction, Catmull-Clark surfaces have been extended to several eminent ways, including the handling of boundaries, infinitely sharp creases, semi-sharp creases, and hierarchically defined detail. For ray tracing of subdivision surfaces, a common way is to construct spatial bounding volume hierarchies on top of input control mesh. However, a high-level refined subdivision surface not only requires a substantial amount of memory storage, but also causes slow and inefficient ray tracing. In this thesis, it presents a new way to improve the efficiency of ray tracing of subdivision surfaces, while the quality is not as good as general methods.Dissertation/ThesisMasters Thesis Computer Science 201
Progressive refinement rendering of implicit surfaces
The visualisation of implicit surfaces can be an inefficient task when such surfaces are complex and highly detailed. Visualising a surface by first converting it to a
polygon mesh may lead to an excessive polygon count. Visualising a surface by direct ray casting is often a slow procedure. In this paper we present a progressive refinement renderer for implicit surfaces that are Lipschitz continuous. The renderer first displays a low resolution estimate of what the final image is going to be and, as the computation progresses, increases the quality of this estimate at an interactive frame rate. This renderer provides a quick previewing facility that significantly reduces the design cycle of a new and complex implicit surface. The renderer is also capable of completing an image faster than a conventional implicit surface rendering algorithm based on ray casting
A progressive refinement approach for the visualisation of implicit surfaces
Visualising implicit surfaces with the ray casting method is a slow procedure. The design cycle of a new implicit surface is, therefore, fraught with long latency times as a user must wait for the surface to be rendered before being able to decide what changes should be introduced in the next iteration. In this paper, we present an attempt at reducing the design cycle of an implicit surface modeler by introducing a progressive refinement rendering approach to the visualisation of implicit surfaces. This progressive refinement renderer provides a quick previewing facility. It first displays a low quality estimate of what the final rendering is going to be and, as the computation progresses, increases the quality of this estimate at a steady rate. The progressive refinement algorithm is based on the adaptive subdivision of the viewing frustrum into smaller cells. An estimate for the variation of the implicit function inside each cell is obtained with an affine arithmetic range estimation technique. Overall, we show that our progressive refinement approach not only provides the user with visual feedback as the rendering advances but is also capable of completing the image faster than a conventional implicit surface rendering algorithm based on ray casting
ADAM: a general method for using various data types in asteroid reconstruction
We introduce ADAM, the All-Data Asteroid Modelling algorithm. ADAM is simple
and universal since it handles all disk-resolved data types (adaptive optics or
other images, interferometry, and range-Doppler radar data) in a uniform manner
via the 2D Fourier transform, enabling fast convergence in model optimization.
The resolved data can be combined with disk-integrated data (photometry). In
the reconstruction process, the difference between each data type is only a few
code lines defining the particular generalized projection from 3D onto a 2D
image plane. Occultation timings can be included as sparse silhouettes, and
thermal infrared data are efficiently handled with an approximate algorithm
that is sufficient in practice due to the dominance of the high-contrast
(boundary) pixels over the low-contrast (interior) ones. This is of particular
importance to the raw ALMA data that can be directly handled by ADAM without
having to construct the standard image. We study the reliability of the
inversion by using the independent shape supports of function series and
control-point surfaces. When other data are lacking, one can carry out fast
nonconvex lightcurve-only inversion, but any shape models resulting from it
should only be taken as illustrative global-scale ones.Comment: 11 pages, submitted to A&
Recommended from our members
Direct Slicing of STEP Based NURBS Models for Solid Freeform Fabrication
Direct slicing of CAD models to generate process planning instructions for solid freeform
fabrication may overcome inherent disadvantages of using STL format in terms of the process
accuracy, ease of file management, and incorporation of multiple materials. This paper will
present the results of our development of a direct slicing algorithm for layered freeform
fabrication. The direct slicing algorithm was based on a neutral, international standard (ISO
10303) STEP-formatted NURBS geometric representation and is intended to be independent of
any commercial CAD software. The following aspects of the development effort will be
presented: 1) Determination of optimal build direction based upon STEP-based NURBS models;
2) Adaptive subdivision of NURBS data for geometric refinement; and 3) Ray-casting slice
generation into sets of raster patterns. Feasibility studies applying the direct slicing algorithm to
example models and the generation of fabrication planning instructions involving multi-material
structures will also be presented.Mechanical Engineerin
Subdivision surface fitting to a dense mesh using ridges and umbilics
Fitting a sparse surface to approximate vast dense data is of interest for many applications: reverse engineering, recognition and compression, etc. The present work provides an approach to fit a Loop subdivision surface to a dense triangular mesh of arbitrary topology, whilst preserving and aligning the original features. The natural ridge-joined connectivity of umbilics and ridge-crossings is used as the connectivity of the control mesh for subdivision, so that the edges follow salient features on the surface. Furthermore, the chosen features and connectivity characterise the overall shape of the original mesh, since ridges capture extreme principal curvatures and ridges start and end at umbilics. A metric of Hausdorff distance including curvature vectors is proposed and implemented in a distance transform algorithm to construct the connectivity. Ridge-colour matching is introduced as a criterion for edge flipping to improve feature alignment. Several examples are provided to demonstrate the feature-preserving capability of the proposed approach
- …