1,727 research outputs found
AlSub: Fully Parallel and Modular Subdivision
In recent years, mesh subdivision---the process of forging smooth free-form
surfaces from coarse polygonal meshes---has become an indispensable production
instrument. Although subdivision performance is crucial during simulation,
animation and rendering, state-of-the-art approaches still rely on serial
implementations for complex parts of the subdivision process. Therefore, they
often fail to harness the power of modern parallel devices, like the graphics
processing unit (GPU), for large parts of the algorithm and must resort to
time-consuming serial preprocessing. In this paper, we show that a complete
parallelization of the subdivision process for modern architectures is
possible. Building on sparse matrix linear algebra, we show how to structure
the complete subdivision process into a sequence of algebra operations. By
restructuring and grouping these operations, we adapt the process for different
use cases, such as regular subdivision of dynamic meshes, uniform subdivision
for immutable topology, and feature-adaptive subdivision for efficient
rendering of animated models. As the same machinery is used for all use cases,
identical subdivision results are achieved in all parts of the production
pipeline. As a second contribution, we show how these linear algebra
formulations can effectively be translated into efficient GPU kernels. Applying
our strategies to , Loop and Catmull-Clark subdivision shows
significant speedups of our approach compared to state-of-the-art solutions,
while we completely avoid serial preprocessing.Comment: Changed structure Added content Improved description
Recommended from our members
Convexity of Bẻzier nets on sub-triangles
This note generalizes a result of Goodman[3], where it is shown that the convexity of Bèzier nets defined on a base triangle is preserved on sub-triangles obtained from a mid-point subdivision process. Here we show that the convexity of Bèzier nets is preserved on and only on sub-triangles that are "parallel" to the base triangle
Cell size distribution in a random tessellation of space governed by the Kolmogorov-Johnson-Mehl-Avrami model: Grain size distribution in crystallization
The space subdivision in cells resulting from a process of random nucleation
and growth is a subject of interest in many scientific fields. In this paper,
we deduce the expected value and variance of these distributions while assuming
that the space subdivision process is in accordance with the premises of the
Kolmogorov-Johnson-Mehl-Avrami model. We have not imposed restrictions on the
time dependency of nucleation and growth rates. We have also developed an
approximate analytical cell size probability density function. Finally, we have
applied our approach to the distributions resulting from solid phase
crystallization under isochronal heating conditions
Computing the minimum distance between a point and a NURBS curve
International audienceA new method is presented for computing the minimum distance between a point and a NURBS curve. It utilizes a circular clipping technique to eliminate the curve parts outside a circle with the test point as its center point. The radius of the elimination circle becomes smaller and smaller during the subdivision process. A simple condition for terminating the subdivision process is provided, which leads to very few subdivision steps in the new method. Examples are shown to illustrate the efficiency and robustness of the new method
Analysis of uniform binary subdivision schemes for curve design
The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form
.0,1,2,...kz,ikj,ifjbm0j1k12ifjam0j1k2if=∈+Σ==++Σ==+
The convergence of the control polygons to a Cu curve is analysed in terms
of the convergence to zero of a derived scheme for the differences - . The analysis of the smoothness of the limit curve is reduced to kif
the convergence analysis of "differentiated" schemes which correspond to
divided differences of {/i ∈Z} with respect to the diadic parameteriz- kif
ation = i/2kitk . The inverse process of "integration" provides schemes
with limit curves having additional orders of smoothness
A New Algorithm for Boolean Operations on General Polygons
International audienceA new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edges of the two general polygons are subdivided at the intersection points and touching points. Thus, the boundaryof the Boolean operation resultant polygon is made of some whole edges of the polygons after the subdivision process. We use the simplex theory to build the basic mathematical model of the new algorithm. The subordination problem between an edge and a polygon is reduced to a problem of determining whether a point is on some edges of some simplices or inside the simplices, and the associated simplicial chain of the resultant polygon is just an assembly of some simplices and their coefficients of the two polygons after the subdivision process. Examples show that the running time required bythe new algorithm is less than one-third of that bythe Rivero and Feito algorithm
- …