387 research outputs found
Acute triangles in triangulations on the plane with minimum degree at least 4
AbstractIn this paper, we show that every maximal plane graph with minimum degree at least 4 and m finite faces other than an octahedron can be drawn in the plane so that at least (m+3)/2 faces are acute triangles. Moreover, this bound is sharp
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology
Survey of two-dimensional acute triangulations
AbstractWe give a brief introduction to the topic of two-dimensional acute triangulations, mention results on related areas, survey existing achievements–with emphasis on recent activity–and list related open problems, both concrete and conceptual
Optimality of Delaunay Triangulations
In this paper, we begin by defining and examining the properties of a Voronoi diagram and extend it to its dual, the Delaunay triangulations. We explore the algorithms that construct such structures. Furthermore, we define several optimal functionals and criterions on the set of all triangulations of points in Rd that achieve their minimum on the Delaunay triangulation. We found a new result and proved that Delaunay triangulation has lexicographically the least circumradii sequence. We discuss the CircumRadii-Area (CRA) conjecture that the circumradii raised to the power of alpha times the area of the triangulation holds true for all α ≥ 1. We took it upon ourselves to prove that CRA conjecture is true for α =1, FRV quadrilaterals, and TRV quadrilaterals. Lastly, we demonstrate counterexamples for alpha\u3c1
On a proper acute triangulation of a polyhedral surface
AbstractLet Σ be a polyhedral surface in R3 with n edges. Let L be the length of the longest edge in Σ, δ be the minimum value of the geodesic distance from a vertex to an edge that is not incident to the vertex, and θ be the measure of the smallest face angle in Σ. We prove that Σ can be triangulated into at most CLn/(δθ) planar and rectilinear acute triangles, where C is an absolute constant
Conforming restricted Delaunay mesh generation for piecewise smooth complexes
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise
smooth domains is described. Built using a restricted Delaunay framework, this
new algorithm combines a number of novel features, including: (i) an
unweighted, conforming restricted Delaunay representation for domains specified
as a (non-manifold) collection of piecewise smooth surface patches and curve
segments, (ii) a protection strategy for domains containing curve segments that
subtend sharply acute angles, and (iii) a new class of off-centre refinement
rules designed to achieve high-quality point-placement along embedded curve
features. Experimental comparisons show that the new Frontal-Delaunay algorithm
outperforms a classical (statically weighted) restricted Delaunay-refinement
technique for a number of three-dimensional benchmark problems.Comment: To appear at the 25th International Meshing Roundtabl
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
- …