Optimal triangulation of polygons
From MaRDI portal
Cites work
- A dihedral acute triangulation of the cube
- Acute and nonobtuse triangulations of polyhedral surfaces
- Acute triangulations of polygons
- Acute triangulations of polygons
- Acute triangulations of polyhedra and \(\mathbb R^N\)
- Acute triangulations of the regular icosahedral surface
- Algorithm 843
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- Approximating the maxmin-angle covering triangulation
- Basic properties of SLE
- Conformal mapping in linear time
- Conformal welding and Koebe's theorem
- Fast Deterministic Selection
- Generalized Delaunay triangulation for planar graphs
- Gesammelte mathematische Abhandlungen. 2 Bände.
- scientific article; zbMATH DE number 437532 (Why is no real title available?)
- scientific article; zbMATH DE number 3160754 (Why is no real title available?)
- scientific article; zbMATH DE number 3986641 (Why is no real title available?)
- scientific article; zbMATH DE number 1260617 (Why is no real title available?)
- scientific article; zbMATH DE number 1795894 (Why is no real title available?)
- scientific article; zbMATH DE number 2163107 (Why is no real title available?)
- scientific article; zbMATH DE number 2164719 (Why is no real title available?)
- scientific article; zbMATH DE number 2174317 (Why is no real title available?)
- scientific article; zbMATH DE number 742947 (Why is no real title available?)
- scientific article; zbMATH DE number 1424294 (Why is no real title available?)
- scientific article; zbMATH DE number 3421121 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- Linear-size nonobtuse triangulation of polygons
- Non-compact Riemann surfaces are equilaterally triangulable
- Nonobtuse triangulation of polygons
- Nonobtuse triangulations of PSLGs
- Numerical Computation of the Schwarz–Christoffel Transformation
- On conformal welding and quasicircles
- On the problem of the stationary temperatures and the representation of a given surface.
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Optimal angle bounds for quadrilateral meshes
- Provably good mesh generation
- Quadrilateral meshes for PSLGs
- Schramm-Loewner evolution
- Schwarz-Christoffel Mapping
- Schwarz-Christoffel mapping in the computer era
- Survey of two-dimensional acute triangulations
- The dissection of a polygon into nearly equilateral triangles
- Tilings of convex polygons
- Time bounds for selection
- Triangulating a simple polygon in linear time
- Uniformly acute triangulations of polygons
- Uniformly acute triangulations of PSLGs
- Unsolved problems in geometry
This page was built for publication: Optimal triangulation of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363872)