Fast Quadtree/Octree adaptive meshing and re-meshing with linear mixed elements

Jaillet, Fabrice; Lobos, Claudio

doi:10.1007/s00366-021-01330-w

Cited by 11 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, image segmentation is an important step that affects the compression ratio and the quality of the model. At present, the commonly used segmentation strategies are quadtree segmentation, fixed block segmentation, and so on [23]. Then, form the codebook, set the step size, and slide the original image according to the step size.…”

Section: Model Compression Optimization Algorithmmentioning

confidence: 99%

Optimization of Three-Dimensional Model of Landscape Space Based on Big Data Analysis

Wang

2022

Journal of Function Spaces

View full text Add to dashboard Cite

Based on virtual reality technology, landscape 3D modeling provides users with the possibility to construct a simulated garden landscape environment design effect online, so it has high requirements for accuracy. With the continuous improvement of precision requirements, the number of people involved in the construction of 3D models is also increasing, which puts forward higher requirements for modeling. Based on this, this paper studies the optimization strategy of landscape space 3D model based on big data analysis. Based on the analysis of the establishment of the 3D model and the related algorithm research, this paper analyzes the optimal design of the 3D model under the background of big data. In the 3D modeling of the edge folded area, it is based on the traditional quadratic error measurement grid simplification algorithm, combined with the vertex error matrix to simplify, so as to shorten the modeling time. Based on an efficient search algorithm, an adaptive nonsearch fractal image compression and decoding method is proposed in the image compression and decoding stage of 3D modeling. The search is performed by specifying the defined area block. Finally, an experiment is designed to analyze the performance of the optimization algorithm. The results show that the improved edge folding region algorithm can reduce errors on the basis of ensuring image quality, and the adaptive search algorithm can shorten the search time and improve the compression rate. This method provides a technical reference for the visualization experience and simulation system of garden landscape design and improves the presentation quality of virtual garden landscape design scenes.

show abstract

Section: Model Compression Optimization Algorithmmentioning

confidence: 99%

Optimization of Three-Dimensional Model of Landscape Space Based on Big Data Analysis

Wang

2022

Journal of Function Spaces

View full text Add to dashboard Cite

show abstract

“…In standard FEM, the most used 2D meshes are triangulations [24,25,28] and quadrilateral meshes [29][30][31]. 2D Mixed meshes composed of triangles and quadrilaterals have also been used, but are not so common as the previous ones [32]. Other numerical methods such as the Voronoi Cell Finite Element Method (VCFEM) [33] and Polygonal Finite Element method (PFEM) [34] use the constrained Voronoi diagram as the polygonal mesh, where the Voronoi cells are the mesh elements [35][36][37].…”

Section: Related Workmentioning

confidence: 99%

POLYLLA: Polygonal meshing algorithm based on terminal-edge regions

Salinas¹,

Hitschfeld²,

Ortiz-Bernardin³

et al. 2022

Preprint

View full text Add to dashboard Cite

This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longestedge of any of the two triangles that share them. The algorithm is termed Polylla and is divided into three phases. The first phase consists of labeling each edge of the input triangulation according to its size; the second phase builds polygons (simple or not) from terminaledges regions using the label system; and the third phase transforms each non simple polygon into simple ones. The final mesh contains polygons with convex and non convex shape. Since Voronoi based meshes are currently the most used polygonal meshes, we compare some geometric properties of our meshes against constrained Voronoi meshes. Several experiments were run to compare the shape and size of polygons, the number of final mesh points and polygons. For the same input, Polylla meshes contain less polygons than Voronoi meshes and

show abstract

“…Visually, the mesh has no T-junctions. Jaillet and Lobos [36] 1 constructed a set of 325 cases to transform a hexahedral mesh with at most one level of subdivision between adjacent cells into a conformal mesh. We therefore translated these cases into vpatterns and applied our query and replace method.…”

Section: Conformal Meshmentioning

confidence: 99%