首页/论文/cs/0202011

arXiv cs/02020112002-02-12cs.CG

Small Strictly Convex Quadrilateral Meshes of Point Sets

David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan

备注：: 25 pages, 23 figures. A preliminary version appeared in ISAAC 2001, Christchurch NZ

英文摘要：

In this paper, we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that $3{\lfloor\frac{n}{2}\rfloor}$ internal Steiner points are always sufficient for a convex quadrilateral mesh of $n$ points in the plane. Furthermore, for any given $n\geq 4$, there are point sets for which $\lceil\frac{n-3}{2}\rceil-1$ Steiner points are necessary for a convex quadrilateral mesh.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral Meshes

We present a novel approach named TBase for smoothing planar and surface quadrilateral meshes. Our motivation is that the best shape of quadrilateral element (square) can be virtually divided into a pair of equilateral right triangles by any of its diagonals. When move a node to smooth a quadrilateral, it is optimal to make a pair of triangles divided by a diagonal be equilateral right triangles separately. The finally smoothed position is obtained by weighting all individual optimal positions. Three variants are produced according to the determination of weights. Tests by the TBase are given …

2012-12-25cs.CG

Optimal angle bounds for quadrilateral meshes

We show that any simple planar n-gon can be meshed in linear time by $O(n)$ quadrilaterals with all new angles bounded between $60$ and $120$ degrees.

2020-07-15cs.CGmath.CV

Diamond-Kite Adaptive Quadrilateral Meshing

We describe a family of quadrilateral meshes based on diamonds, rhombi with 60 and 120 degree angles, and kites with 60, 90, and 120 degree angles, that can be adapted to a local size function by local subdivision operations. Our meshes use a number of elements that is within a constant factor of the minimum possible for any mesh of bounded aspect ratio elements, graded by the same local size function, and is invariant under Laplacian smoothing. The vertices of our meshes form the centers of the circles in a pair of dual circle packings. The same vertex placement algorithm but a different mesh…

2013-01-08cs.CG

Quadrilateral meshes for PSLGs

We prove that every planar straight line graph with $n$ vertices has a conforming quadrilateral mesh with $O(n^2)$ elements, all angles $\leq 120^\circ$ and all new angles $\geq 60^\circ$. Both the complexity and the angle bounds are sharp. Moreover, all but $O(n)$ of the angles may be taken in a smaller interval, say $[89^\circ, 91^\circ]$.

2020-07-20cs.CGmath.CV

Connectivity Compression for Irregular Quadrilateral Meshes

Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We present an algorithm for encoding the connectivity of such quadrilateral meshes, and we demonstrate that by preserving and exploiting the original quad structure, our approach achieves encodings 30 - 80% smal…

2000-05-04cs.CGcs.DScs.GR

Quadrilateral Meshing by Circle Packing

We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements form the cells of a Voronoi diagram, (2) all elements have two opposite right angles, (3) all elements are kites, or (4) all angles are at most 120 degrees. In each case the total number of elements is O(n), where n is the number of input vertices.

1999-08-19cs.CG

更多相关论文收起更多论文

A parallel edge orientation algorithm for quadrilateral meshes

One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve this for any mesh composed of simplex elements, and deal.II contains a serial algorithm to construct a consistent orientation of any quadrilateral mesh of an orientable manifold. The core contribution of this paper is the extension of this algorithm for distributed memory parallel computers, which facilitates its seamless application as part of a parallel sim…

2015-12-11cs.CGcs.MS

Flipping Cubical Meshes

We define and examine flip operations for quadrilateral and hexahedral meshes, similar to the flipping transformations previously used in triangular and tetrahedral mesh generation.

2002-07-24cs.CG

The Modified Direct Method: an Approach for Smoothing Planar and Surface Meshes

The Modified Direct Method (MDM) is an iterative mesh smoothing method for smoothing planar and surface meshes, which is developed from the non-iterative smoothing method originated by Balendran [1]. When smooth planar meshes, the performance of the MDM is effectively identical to that of Laplacian smoothing, for triangular and quadrilateral meshes; however, the MDM outperforms Laplacian smoothing for tri-quad meshes. When smooth surface meshes, for trian-gular, quadrilateral and quad-dominant mixed meshes, the mean quality(MQ) of all mesh elements always increases and the mean square error (M…

2012-12-13cs.CGcs.NAmath.NA

High quality mesh generation using cross and asterisk fields: Application on coastal domains

This paper presents a method to generate high quality triangular or quadrilateral meshes that uses direction fields and a frontal point insertion strategy. Two types of direction fields are considered: asterisk fields and cross fields. With asterisk fields we generate high quality triangulations, while with cross fields we generate right-angled triangulations that are optimal for transformation to quadrilateral meshes. The input of our algorithm is an initial triangular mesh and a direction field calculated on it. The goal is to compute the vertices of the final mesh by an advancing front stra…

2017-06-07cs.CG

在拉格uerre几何中用四边网格进行近似

Approximation by Quad Meshes in Laguerre Geometry

King Abdullah University of Science and Technology（阿卜杜拉国王科技大学）；Vienna University of Technology（维也纳工业大学）

研究了拉格uerre球几何中平面四边形网格的类比及用其近似光滑表面的方法，提出拉格uerre共轭网格的概念并用于表面近似。

2026-06-29cs.CGmath.DG

Quasi-structured quadrilateral meshing in Gmsh -- a robust pipeline for complex CAD models

We propose an end-to-end pipeline to robustly generate high-quality quadrilateral meshes for complex CAD models. An initial quad-dominant mesh is generated with frontal point insertion guided by a locally integrable cross field and a scalar size map adapted to the small CAD features. After triangle combination and midpoint-subdivision into an all-quadrilateral mesh, the topology of the mesh is modified to reduce the number of irregular vertices. The idea is to preserve the irregular vertices matching cross-field singularities and to eliminate the others. The topological modifications are eithe…

2021-03-08cs.CEcs.CGcs.MS

Quadrilateral Mesh Generation II : Meromorphic Quartic Differentials and Abel-Jacobi Condition

This work discovers the equivalence relation between quadrilateral meshes and meromorphic quartic. Each quad-mesh induces a conformal structure of the surface, and a meromorphic differential, where the configuration of singular vertices correspond to the configurations the poles and zeros (divisor) of the meroromorphic differential. Due to Riemann surface theory, the configuration of singularities of a quad-mesh satisfies the Abel-Jacobi condition. Inversely, if a satisfies the Abel-Jacobi condition, then there exists a meromorphic quartic differential whose equals to the given one. Furthermor…

2019-06-29cs.CG

Two improvements of the foliation based quad meshing method

Quadrilateral meshes with high level structure and feature preserving property benefit industrial applications the most. Generation of such quad mesh remains a challenge. Quad meshes generated using surface foliation have the highest level structure, however they lack of the feature preserving ability. In this paper, we analyze the boundary curvature with Gauss-Bonnet theorem to determine whether a boundary rectangle corner preserving foliation based method exists. When it exists, we adopt a modified double cover technique together with surface foliation method to generate a corner feature pre…

2022-05-30cs.CG

Naturally curved quadrilateral mesh generation using an adaptive spectral element solver

We describe an adaptive version of a method for generating valid naturally curved quadrilateral meshes. The method uses a guiding field, derived from the concept of a cross field, to create block decompositions of multiply connected two dimensional domains. The a priori curved quadrilateral blocks can be further split into a finer high-order mesh as needed. The guiding field is computed by a Laplace equation solver using a continuous Galerkin or discontinuous Galerkin spectral element formulation. This operation is aided by using $p$-adaptation to achieve faster convergence of the solution wit…

2019-09-18cs.CGcs.NAmath.NA

学习网格上的拓扑操作及其在多边形块分解中的应用

Learning topological operations on meshes with application to block decomposition of polygons

University of California, Berkeley（加州大学伯克利分校）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）

提出基于自博弈强化学习的框架，通过标准局部和全局单元操作优化非结构化网格质量，最小化节点度数偏差并减少不规则节点。

2023-09-12cs.CGcs.LG

A High Resolution PDE Approach to Quadrilateral Mesh Generation

We describe a high order technique to generate quadrilateral decompositions and meshes for complex two dimensional domains using spectral elements in a field guided procedure. Inspired by cross field methods, we never actually compute crosses. Instead, we compute a high order accurate guiding field using a continuous Galerkin (CG) or discontinuous Galerkin (DG) spectral element method to solve a Laplace equation for each of the field variables using the open source code Nektar++. The spectral method provides spectral convergence and sub-element resolution of the fields. The DG approximation al…

2019-08-30cs.CGcs.NAmath.NA

Generation of High-Order Coarse Quad Meshes on CAD Models via Integer Linear Programming

We propose an end-to-end pipeline to robustly generate high-quality, high-order and coarse quadrilateral meshes on CAD models. This kind of mesh enables the use of high-order analysis techniques such as high-order finite element methods or isogeometric analysis. An initial unstructured mesh is generated; this mesh contains a low number of irregular vertices but these are not necessarily aligned, causing a very dense quad layout. A T-mesh is built on the mesh which allows to modify its topology by assigning new integer lengths to the T-mesh arcs. The task of simplifying the quad layout can be f…

2021-08-05cs.CEcs.CG

A 44-element mesh of Schneiders' pyramid: bounding the difficulty of hex-meshing problems

This paper shows that constraint programming techniques can successfully be used to solve challenging hex-meshing problems. Schneiders' pyramid is a square-based pyramid whose facets are subdivided into three or four quadrangles by adding vertices at edge midpoints and facet centroids. In this paper, we prove that Schneiders' pyramid has no hexahedral meshes with fewer than 18 interior vertices and 17 hexahedra, and introduce a valid mesh with 44 hexahedra. We also construct the smallest known mesh of the octagonal spindle, with 40 hexahedra and 42 interior vertices. These results were obtaine…

2018-09-21cs.CG

Snow Globe: An Advancing-Front 3D Delaunay Mesh Refinement Algorithm

<incorrect proofs; does not consider an important case because of which the proofs are wrong. The paper was withdrawn from submission> One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral elements having a bounded aspect ratio, which is the ratio between the radius of the circumscribing and inscribing spheres. The refinement is carried out by inserting additional Steiner vertices inside the circumsphere of a poor-quality tetrahedron (to remove the tetrahedron) at a sufficient distance from existing vertices to guarantee the termination and size op…

2018-08-04cs.CGcs.DS