Linear-size nonobtuse triangulation of polygons

DOI10.1007/BF02570715zbMath0841.68118MaRDI QIDQ1906045

Yanyan Li

Publication date: 14 July 1996

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131411

zbMATH Keywords

triangulationSteiner points

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (22)

Distance-sensitive planar point location ⋮ Quadrilateral meshes for PSLGs ⋮ Nonobtuse triangulations of PSLGs ⋮ A fast and practical method to pack spheres for mesh generation ⋮ Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings ⋮ Balanced triangulations ⋮ Uniformly acute triangulations of PSLGs ⋮ Uniformly acute triangulations of polygons ⋮ Origami embedding of piecewise-linear two-manifolds ⋮ Acute triangulations of polyhedra and \(\mathbb R^N\) ⋮ Tiling space and slabs with acute tetrahedra. ⋮ High-quality 2D mesh generation without obtuse and small angles ⋮ Triangulating a convex polygon with fewer number of non-standard bars ⋮ Acute triangulations of polygons ⋮ Generation of finite element mesh with variable size over an unbounded 2D domain ⋮ Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain ⋮ On a proper acute triangulation of a polyhedral surface ⋮ QUADRILATERAL MESHING BY CIRCLE PACKING ⋮ Origami Embedding of Piecewise-Linear Two-Manifolds ⋮ Acute and nonobtuse triangulations of polyhedral surfaces ⋮ Approximating uniform triangular meshes in polygons. ⋮ Safe and stabilizing distributed multi-path cellular flows

Uses Software

• Matlab
• DELAUNDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for conforming Delaunay triangulations
• Nonobtuse triangulation of polygons
• A sweepline algorithm for Voronoi diagrams
• Constructing the Voronoi diagram of a set of line segments in parallel
• Provably good mesh generation
• A data structure for dynamic trees
• Incremental topological flipping works for regular triangulations
• Decomposable searching problems I. Static-to-dynamic transformation
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
• Faster Circle Packing with Application to Nonobtuse Triangulation
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

This page was built for publication: Linear-size nonobtuse triangulation of polygons