157,861 research outputs found
Computational Geometry Column 39
The resolution of a decades-old open problem is described: polygonal chains
cannot lock in the plane.Comment: 4 pages, 2 figures. To appear in SIGACT News and in Int. J. Comp.
Geom. App
Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
The goal of this paper is to introduce a new method in computer-aided
geometry of solid modeling. We put forth a novel algebraic technique to
evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with
regularized operators of union, intersection, and difference, i.e., any CSG
tree. The result is obtained in three steps: first, by computing an independent
set of generators for the d-space partition induced by the input; then, by
reducing the solid expression to an equivalent logical formula between Boolean
terms made by zeros and ones; and, finally, by evaluating this expression using
bitwise operators. This method is implemented in Julia using sparse arrays. The
computational evaluation of every possible solid expression, usually denoted as
CSG (Constructive Solid Geometry), is reduced to an equivalent logical
expression of a finite set algebra over the cells of a space partition, and
solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig
Fast Isogeometric Boundary Element Method based on Independent Field Approximation
An isogeometric boundary element method for problems in elasticity is
presented, which is based on an independent approximation for the geometry,
traction and displacement field. This enables a flexible choice of refinement
strategies, permits an efficient evaluation of geometry related information, a
mixed collocation scheme which deals with discontinuous tractions along
non-smooth boundaries and a significant reduction of the right hand side of the
system of equations for common boundary conditions. All these benefits are
achieved without any loss of accuracy compared to conventional isogeometric
formulations. The system matrices are approximated by means of hierarchical
matrices to reduce the computational complexity for large scale analysis. For
the required geometrical bisection of the domain, a strategy for the evaluation
of bounding boxes containing the supports of NURBS basis functions is
presented. The versatility and accuracy of the proposed methodology is
demonstrated by convergence studies showing optimal rates and real world
examples in two and three dimensions.Comment: 32 pages, 27 figure
Arbitrary-Lagrangian-Eulerian discontinuous Galerkin schemes with a posteriori subcell finite volume limiting on moving unstructured meshes
We present a new family of high order accurate fully discrete one-step
Discontinuous Galerkin (DG) finite element schemes on moving unstructured
meshes for the solution of nonlinear hyperbolic PDE in multiple space
dimensions, which may also include parabolic terms in order to model
dissipative transport processes. High order piecewise polynomials are adopted
to represent the discrete solution at each time level and within each spatial
control volume of the computational grid, while high order of accuracy in time
is achieved by the ADER approach. In our algorithm the spatial mesh
configuration can be defined in two different ways: either by an isoparametric
approach that generates curved control volumes, or by a piecewise linear
decomposition of each spatial control volume into simplex sub-elements. Our
numerical method belongs to the category of direct
Arbitrary-Lagrangian-Eulerian (ALE) schemes, where a space-time conservation
formulation of the governing PDE system is considered and which already takes
into account the new grid geometry directly during the computation of the
numerical fluxes. Our new Lagrangian-type DG scheme adopts the novel a
posteriori sub-cell finite volume limiter method, in which the validity of the
candidate solution produced in each cell by an unlimited ADER-DG scheme is
verified against a set of physical and numerical detection criteria. Those
cells which do not satisfy all of the above criteria are flagged as troubled
cells and are recomputed with a second order TVD finite volume scheme. The
numerical convergence rates of the new ALE ADER-DG schemes are studied up to
fourth order in space and time and several test problems are simulated.
Finally, an application inspired by Inertial Confinement Fusion (ICF) type
flows is considered by solving the Euler equations and the PDE of viscous and
resistive magnetohydrodynamics (VRMHD).Comment: 39 pages, 21 figure
Faster Geometric Algorithms via Dynamic Determinant Computation
The computation of determinants or their signs is the core procedure in many
important geometric algorithms, such as convex hull, volume and point location.
As the dimension of the computation space grows, a higher percentage of the
total computation time is consumed by these computations. In this paper we
study the sequences of determinants that appear in geometric algorithms. The
computation of a single determinant is accelerated by using the information
from the previous computations in that sequence.
We propose two dynamic determinant algorithms with quadratic arithmetic
complexity when employed in convex hull and volume computations, and with
linear arithmetic complexity when used in point location problems. We implement
the proposed algorithms and perform an extensive experimental analysis. On one
hand, our analysis serves as a performance study of state-of-the-art
determinant algorithms and implementations. On the other hand, we demonstrate
the supremacy of our methods over state-of-the-art implementations of
determinant and geometric algorithms. Our experimental results include a 20 and
78 times speed-up in volume and point location computations in dimension 6 and
11 respectively.Comment: 29 pages, 8 figures, 3 table
- …