7,157 research outputs found
Phase-field boundary conditions for the voxel finite cell method: surface-free stress analysis of CT-based bone structures
The voxel finite cell method employs unfitted finite element meshes and voxel quadrature rules to seamlessly
transfer CT data into patient-specific bone discretizations. The method, however, still requires the explicit
parametrization of boundary surfaces to impose traction and displacement boundary conditions, which
constitutes a potential roadblock to automation. We explore a phase-field based formulation for imposing
traction and displacement constraints in a diffuse sense. Its essential component is a diffuse geometry model
generated from metastable phase-field solutions of the Allen-Cahn problem that assumes the imaging data as
initial condition. Phase-field approximations of the boundary and its gradient are then employed to transfer
all boundary terms in the variational formulation into volumetric terms. We show that in the context of the
voxel finite cell method, diffuse boundary conditions achieve the same accuracy as boundary conditions
defined over explicit sharp surfaces, if the inherent length scales, i.e., the interface width of the phase-field,
the voxel spacing and the mesh size, are properly related. We demonstrate the flexibility of the new method
by analyzing stresses in a human femur and a vertebral body
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
In this paper we study two geometric data structure problems in the special
case when input objects or queries are fat rectangles. We show that in this
case a significant improvement compared to the general case can be achieved.
We describe data structures that answer two- and three-dimensional orthogonal
range reporting queries in the case when the query range is a \emph{fat}
rectangle. Our two-dimensional data structure uses words and supports
queries in time, where is the number of points in the
data structure, is the size of the universe and is the number of points
in the query range. Our three-dimensional data structure needs
words of space and answers queries in time. We also consider the rectangle stabbing problem on a set of
three-dimensional fat rectangles. Our data structure uses space and
answers stabbing queries in time.Comment: extended version of a WADS'19 pape
Distance-Sensitive Planar Point Location
Let be a connected planar polygonal subdivision with edges
that we want to preprocess for point-location queries, and where we are given
the probability that the query point lies in a polygon of
. We show how to preprocess such that the query time
for a point~ depends on~ and, in addition, on the distance
from to the boundary of~---the further away from the boundary, the
faster the query. More precisely, we show that a point-location query can be
answered in time , where
is the shortest Euclidean distance of the query point~ to the
boundary of . Our structure uses space and
preprocessing time. It is based on a decomposition of the regions of
into convex quadrilaterals and triangles with the following
property: for any point , the quadrilateral or triangle
containing~ has area . For the special case where
is a subdivision of the unit square and
, we present a simpler solution that achieves a
query time of . The latter solution can be extended to
convex subdivisions in three dimensions
Single-Strip Triangulation of Manifolds with Arbitrary Topology
Triangle strips have been widely used for efficient rendering. It is
NP-complete to test whether a given triangulated model can be represented as a
single triangle strip, so many heuristics have been proposed to partition
models into few long strips. In this paper, we present a new algorithm for
creating a single triangle loop or strip from a triangulated model. Our method
applies a dual graph matching algorithm to partition the mesh into cycles, and
then merges pairs of cycles by splitting adjacent triangles when necessary. New
vertices are introduced at midpoints of edges and the new triangles thus formed
are coplanar with their parent triangles, hence the visual fidelity of the
geometry is not changed. We prove that the increase in the number of triangles
due to this splitting is 50% in the worst case, however for all models we
tested the increase was less than 2%. We also prove tight bounds on the number
of triangles needed for a single-strip representation of a model with holes on
its boundary. Our strips can be used not only for efficient rendering, but also
for other applications including the generation of space filling curves on a
manifold of any arbitrary topology.Comment: 12 pages, 10 figures. To appear at Eurographics 200
Fractal Systems of Central Places Based on Intermittency of Space-filling
The central place models are fundamentally important in theoretical geography
and city planning theory. The texture and structure of central place networks
have been demonstrated to be self-similar in both theoretical and empirical
studies. However, the underlying rationale of central place fractals in the
real world has not yet been revealed so far. This paper is devoted to
illustrating the mechanisms by which the fractal patterns can be generated from
central place systems. The structural dimension of the traditional central
place models is d=2 indicating no intermittency in the spatial distribution of
human settlements. This dimension value is inconsistent with empirical
observations. Substituting the complete space filling with the incomplete space
filling, we can obtain central place models with fractional dimension D<d=2
indicative of spatial intermittency. Thus the conventional central place models
are converted into fractal central place models. If we further integrate the
chance factors into the improved central place fractals, the theory will be
able to well explain the real patterns of urban places. As empirical analyses,
the US cities and towns are employed to verify the fractal-based models of
central places.Comment: 30 pages, 8 figures, 5 table
- …