Polygons Have Ears
From MaRDI portal
Cited in
(33)- Isomorphisms of \(AC(\sigma)\) spaces
- Computing Simple Paths on Points in Simple Polygons
- Vectorial crystallization problems and collective behavior
- Langevin dynamic for the 2D Yang-Mills measure
- High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations
- Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
- The art gallery theorem, revisited
- Algorithmic enumeration of surrounding polygons
- The Jordan Curve Theorem and an unpublished manuscript by Max Dehn
- The complex of non-crossing diagonals of a polygon
- Guarding curvilinear art galleries with vertex or point guards
- \(\lambda\)-stability of periodic billiard orbits
- A simple linear algorithm for intersecting convex polygons
- Snakes: legal, illegal and dodecahedral
- Arbitrary polygon mesh for elastic and elastoplastic analysis of solids using smoothed finite element method
- All triangulations are reachable via sequences of edge-flips: an elementary proof
- On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples
- A high-order, conservative and positivity-preserving intersection-based remapping method between meshes with isoparametric curvilinear cells
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- Internal continuous flattening of polyhedra
- A solution to Sheil-Small’s harmonic mapping problem for polygons
- Permutation groups and frieze patterns of type \(\mathbb{A}\)
- Segment-based vs. element-based integration for mortar methods in computational contact mechanics
- Mutation as metric on permutation group S_n
- An accurate, robust, and easy-to-implement method for integration over arbitrary polyhedra: application to embedded interface methods
- Affine invariant triangulations
- Adaptive quadratures for nonlinear approximation of low-dimensional PDEs using smooth neural networks
- On nontriangulable polyhedra
- An Euler-Maclaurin formula for polygonal sums
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
- On decomposition of embedded prismatoids in \(\mathbb{R}^3\) without additional points
- Efficient and qualified mesh generation for Gaussian molecular surface using adaptive partition and piecewise polynomial approximation
- Fully packed loops in a triangle: matchings, paths and puzzles
This page was built for publication: Polygons Have Ears
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060124)