Nonobtuse triangulations of PSLGs
From MaRDI portal
Publication:306497
DOI10.1007/s00454-016-9772-8zbMath1348.68280arXiv2007.10041OpenAlexW989082841MaRDI QIDQ306497
Publication date: 31 August 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.10041
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Quadrilateral meshes for PSLGs ⋮ Uniformly acute triangulations of PSLGs ⋮ Uniformly acute triangulations of polygons ⋮ Construction and Local Routing for Angle-Monotone Graphs ⋮ Edge-Unfolding Nearly Flat Convex Caps
Uses Software
Cites Work
- Quadrilateral meshes for PSLGs
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- An upper bound for conforming Delaunay triangulations
- The dissection of a polygon into nearly equilateral triangles
- Acute triangulations of the regular dodecahedral surface
- Adaptive spacetime meshing for discontinuous Galerkin methods
- Acute and nonobtuse triangulations of polyhedral surfaces
- Nonobtuse triangulation of polygons
- Drawing the planar dual
- Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains
- Provably good mesh generation
- Point placement algorithms for Delaunay triangulation of polygonal domains
- Delaunay refinement algorithms for triangular mesh generation
- Survey of two-dimensional acute triangulations
- About Delaunay triangulations and discrete maximum principles for the linear conforming FEM applied to the Poisson equation.
- Acute triangulations of the regular icosahedral surface
- Linear-size nonobtuse triangulation of polygons
- An optimal bound for high-quality conforming triangulations
- A dihedral acute triangulation of the cube
- Acute triangulations of flat Möbius strips
- A discrete Laplace-Beltrami operator for simplicial surfaces
- There is no face-to-face partition of \(R^5\) into acute simplices
- Acute triangulations of flat tori
- Maximum principle and uniform convergence for the finite element method
- PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD
- Well-Centered Triangulation
- Quality Triangulations with Locally Optimal Steiner Points
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On Nonobtuse Simplicial Partitions
- Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Fast Marching Methods
- TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
- Stable Finite Elements for Problems with Wild Coefficients
- Spacetime meshing with adaptive refinement and coarsening
- Acute triangulations of polygons
- Acute triangulations of polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonobtuse triangulations of PSLGs
