scientific article; zbMATH DE number 1409186
From MaRDI portal
Publication:4940023
Recommendations
Cited in
(25)- The enumeration of akempic triangulations
- On the numbers of n-tangencies of polygons in odd dimensional Euclidean spaces
- Triangulations, visibility graph and reflex vertices of a simple polygon
- The number of geometric bistellar neighbors of a triangulation
- Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
- New counts for the number of triangulations of cyclic polytopes
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- Ears of triangulations and Catalan numbers
- Minimum number of partial triangulations
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- A new lower bound on the maximum number of plane graphs using production matrices
- Counting triangulations and other crossing-free structures approximately
- On the number of pseudo-triangulations of certain point sets
- Families of \(m\)-convex polygons: \(m=1\)
- On the number of crossing-free partitions
- Enumeration of Almost-Convex Polygons on the Square Lattice
- scientific article; zbMATH DE number 1741017 (Why is no real title available?)
- scientific article; zbMATH DE number 1789704 (Why is no real title available?)
- How many potatoes are in a mesh?
- Counting triangulations of balanced subdivisions of convex polygons
- Orbiting triangle method for convex polygon triangulation
- Counting triangulations of some classes of subdivided convex polygons
- On degrees in random triangulations of point sets
- Chains, Koch chains, and point sets with many triangulations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940023)
